Pascal Schweitzer

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 74

Top Venues

Publications

Thomas Schneider, Pascal Schweitzer
An Upper Bound on the Weisfeiler-Leman Dimension. CoRR (2024)
Moritz Lichter, Pascal Schweitzer
Choiceless Polynomial Time with Witnessed Symmetric Choice. J. ACM 71 (2) (2024)
Moritz Lichter, Simon Raßmann, Pascal Schweitzer
Computational complexity of the Weisfeiler-Leman dimension. CoRR (2024)
Billy Joe Franks, Markus Anders, Marius Kloft, Pascal Schweitzer
A Systematic Approach to Universal Random Features in Graph Neural Networks. Trans. Mach. Learn. Res. 2023 (2023)
Markus Anders, Pascal Schweitzer, Julian Stieß
Engineering a Preprocessor for Symmetry Detection. SEA (2023)
Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
Exploration of Graphs with Excluded Minors. ESA (2023)
Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
Exploration of graphs with excluded minors. CoRR (2023)
Markus Anders, Pascal Schweitzer, Mate Soos
Algorithms Transcending the SAT-Symmetry Interface. SAT (2023)
Martin Grohe, Daniel Neuen, Pascal Schweitzer
A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. 52 (6) (2023)
Markus Anders, Pascal Schweitzer, Mate Soos
Algorithms Transcending the SAT-Symmetry Interface. CoRR (2023)
Markus Anders, Pascal Schweitzer, Julian Stieß
Engineering a Preprocessor for Symmetry Detection. CoRR (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS (2023)
Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR (2023)
Sandra Kiefer, Pascal Schweitzer, Erkal Selman
Graphs Identified by Logics with Counting. ACM Trans. Comput. Log. 23 (1) (2022)
Jendrik Brachter, Pascal Schweitzer
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. ESA (2022)
Moritz Lichter, Pascal Schweitzer
Choiceless Polynomial Time with Witnessed Symmetric Choice. LICS (2022)
Moritz Lichter, Pascal Schweitzer
Choiceless Polynomial Time with Witnessed Symmetric Choice. CoRR (2022)
Pascal Schweitzer, Constantin Seebach
Resolution with Symmetry Rule Applied to Linear Equations. STACS (2021)
Markus Anders, Pascal Schweitzer
Parallel Computation of Combinatorial Symmetries. ESA (2021)
Pascal Schweitzer
Technical perspective: A logical step toward the graph isomorphism problem. Commun. ACM 64 (5) (2021)
Markus Anders, Pascal Schweitzer, Florian Wetzels
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. ICALP (2021)
Markus Anders, Pascal Schweitzer
Engineering a Fast Probabilistic Isomorphism Test. ALENEX (2021)
Markus Anders, Pascal Schweitzer
Parallel Computation of Combinatorial Symmetries. CoRR (2021)
Pascal Schweitzer, Constantin Seebach
Resolution with Symmetry Rule applied to Linear Equations. CoRR (2021)
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
Deep Weisfeiler Leman. SODA (2021)
Billy Joe Franks, Markus Anders, Marius Kloft, Pascal Schweitzer
Trainability for Universal GNNs Through Surgical Randomness. CoRR (2021)
Markus Anders, Pascal Schweitzer, Florian Wetzels
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case. CoRR (2021)
Markus Anders, Pascal Schweitzer
Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms. ICALP (2021)
Markus Anders, Jendrik Brachter, Pascal Schweitzer
A Characterization of Individualization-Refinement Trees. CoRR (2021)
Moritz Lichter, Pascal Schweitzer
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CSL (2021)
Markus Anders, Jendrik Brachter, Pascal Schweitzer
A Characterization of Individualization-Refinement Trees. ISAAC (2021)
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
Deep Weisfeiler Leman. CoRR (2020)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16 (3) (2020)
Martin Grohe, Pascal Schweitzer
The graph isomorphism problem. Commun. ACM 63 (11) (2020)
Markus Anders, Pascal Schweitzer
Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms. CoRR (2020)
Jendrik Brachter, Pascal Schweitzer
On the Weisfeiler-Leman Dimension of Finite Groups. CoRR (2020)
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
Automorphism groups of graphs of bounded Hadwiger number. CoRR (2020)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. 64 (3) (2020)
Jendrik Brachter, Pascal Schweitzer
On the Weisfeiler-Leman Dimension of Finite Groups. LICS (2020)
Moritz Lichter, Pascal Schweitzer
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CoRR (2020)
Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer
Stochastic Dominance and the Bijective Ratio of Online Algorithms. Algorithmica 82 (5) (2020)
Markus Anders, Pascal Schweitzer
Engineering a Fast Probabilistic Isomorphism Test. CoRR (2020)
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. J. ACM 66 (6) (2019)
Pascal Schweitzer, Daniel Wiebking
A unifying method for the design of algorithms canonizing combinatorial objects. STOC (2019)
Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. CoRR (2019)
Sandra Kiefer, Pascal Schweitzer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic. Log. Methods Comput. Sci. 15 (2) (2019)
Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. LICS (2019)
Martin Grohe, Daniel Neuen, Pascal Schweitzer
A Faster Isomorphism Test for Graphs of Small Degree. FOCS (2018)
Daniel Neuen, Pascal Schweitzer
An exponential lower bound for individualization-refinement algorithms for graph isomorphism. STOC (2018)
Pascal Schweitzer, Daniel Wiebking
A unifying method for the design of algorithms canonizing combinatorial objects. CoRR (2018)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS (2018)
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
Induced Minor Free Graphs: Isomorphism and Clique-Width. Algorithmica 80 (1) (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer
Towards faster isomorphism tests for bounded-degree graphs. CoRR (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An improved isomorphism test for bounded-tree-width graphs. CoRR (2018)
Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP (2018)
Stefan Kratsch, Pascal Schweitzer
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. Discret. Appl. Math. 216 (2017)
Michael Elberfeld, Pascal Schweitzer
Canonizing Graphs of Bounded Tree Width in Logspace. ACM Trans. Comput. Theory 9 (3) (2017)
Pascal Schweitzer
A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry. ICALP (2017)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR (2017)
Pascal Schweitzer
A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry. CoRR (2017)
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3. CoRR (2017)
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
The Weisfeiler-Leman dimension of planar graphs is at most 3. LICS (2017)
Daniel Neuen, Pascal Schweitzer
Benchmark Graphs for Practical Graph Isomorphism. ESA (2017)
Daniel Neuen, Pascal Schweitzer
Benchmark Graphs for Practical Graph Isomorphism. CoRR (2017)
Pascal Schweitzer
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. Theory Comput. Syst. 61 (4) (2017)
Daniel Neuen, Pascal Schweitzer
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism. CoRR (2017)
Pascal Schweitzer, Patrick Schweitzer
Minimal asymmetric graphs. J. Comb. Theory, Ser. B 127 (2017)
Martin Grohe, Pascal Schweitzer
Computing with Tangles. SIAM J. Discret. Math. 30 (2) (2016)
Sandra Kiefer, Pascal Schweitzer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. CoRR (2016)
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
Induced Minor Free Graphs: Isomorphism and Clique-width. CoRR (2016)
Wenchao Li, Hossein Saidi, Huascar Sanchez, Martin Schäf, Pascal Schweitzer
Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel. ICSR (2016)
Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer
Stochastic dominance and the bijective ratio of online algorithms. CoRR (2016)
Michael Elberfeld, Pascal Schweitzer
Canonizing Graphs of Bounded Tree Width in Logspace. STACS (2016)
Sandra Kiefer, Pascal Schweitzer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. LICS (2016)
Pascal Schweitzer
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. STACS (2015)
Michael Elberfeld, Pascal Schweitzer
Canonizing Graphs of Bounded Tree Width in Logspace. CoRR (2015)
Martin Grohe, Pascal Schweitzer
Isomorphism Testing for Graphs of Bounded Rank Width. FOCS (2015)
Sandra Kiefer, Pascal Schweitzer, Erkal Selman
Graphs Identified by Logics with Counting. CoRR (2015)
Martin Grohe, Pascal Schweitzer
Computing with Tangles. STOC (2015)
Rémy Belmonte, Yota Otachi, Pascal Schweitzer
Induced Minor Free Graphs: Isomorphism and Clique-width. WG (2015)
László Babai, Anuj Dawar, Pascal Schweitzer, Jacobo Torán
The Graph Isomorphism Problem (Dagstuhl Seminar 15511). Dagstuhl Reports 5 (12) (2015)
Martin Grohe, Pascal Schweitzer
Computing with Tangles. CoRR (2015)
Sandra Kiefer, Pascal Schweitzer, Erkal Selman
Graphs Identified by Logics with Counting. MFCS (1) (2015)
Martin Grohe, Pascal Schweitzer
Isomorphism Testing for Graphs of Bounded Rank Width. CoRR (2015)
Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica 72 (4) (2015)
Pascal Schweitzer
Towards an Isomorphism Dichotomy for Hereditary Graph Classes. CoRR (2014)
Yota Otachi, Pascal Schweitzer
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. SWAT (2014)
Yota Otachi, Pascal Schweitzer
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters. CoRR (2014)
Brendan D. McKay, Pascal Schweitzer
Switching Reconstruction of Digraphs. J. Graph Theory 76 (4) (2014)
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
Depth-First Search Using O(n) Bits. ISAAC (2014)
Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer
Competition Numbers, Quasi-line Graphs, and Holes. SIAM J. Discret. Math. 28 (1) (2014)
Pascal Schweitzer
Iterated open neighborhood graphs and generalizations. Discret. Appl. Math. 161 (10-11) (2013)
Yota Otachi, Pascal Schweitzer
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. ISAAC (2013)
Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
A Linear-Time Algorithm for Testing Outer-1-Planarity. Graph Drawing (2013)
Weifa Liang, Pascal Schweitzer, Zichuan Xu
Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink. IEEE Trans. Computers 62 (10) (2013)
Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513 (2013)
Spyros Angelopoulos, Pascal Schweitzer
Paging and list update under bijective analysis. J. ACM 60 (2) (2013)
Stefan Kratsch, Pascal Schweitzer
Graph Isomorphism for Graph Classes Characterized by two Forbidden Induced Subgraphs CoRR (2012)
Stefan Kratsch, Pascal Schweitzer
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. WG (2012)
Pascal Schweitzer
On Zero Divisors with Small Support in Group Rings of Torsion-Free Groups CoRR (2012)

Pascal Schweitzer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pascal Schweitzer