Pascal Schweitzer

According to our database1, Pascal Schweitzer authored at least 56 papers between 2007 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case.
CoRR, 2021

Resolution with Symmetry Rule Applied to Linear Equations.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Deep Weisfeiler Leman.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

Engineering a Fast Probabilistic Isomorphism Test.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

An Improved Isomorphism Test for Bounded-tree-width Graphs.
ACM Trans. Algorithms, 2020

Space-Efficient Algorithms for Longest Increasing Subsequence.
Theory Comput. Syst., 2020

Automorphism groups of graphs of bounded Hadwiger number.
CoRR, 2020

Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms.
CoRR, 2020

The graph isomorphism problem.
Commun. ACM, 2020

Stochastic Dominance and the Bijective Ratio of Online Algorithms.
Algorithmica, 2020

On the Weisfeiler-Leman Dimension of Finite Groups.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic.
Log. Methods Comput. Sci., 2019

The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3.
J. ACM, 2019

A unifying method for the design of algorithms canonizing combinatorial objects.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Towards faster isomorphism tests for bounded-degree graphs.
CoRR, 2018

Induced Minor Free Graphs: Isomorphism and Clique-Width.
Algorithmica, 2018

An exponential lower bound for individualization-refinement algorithms for graph isomorphism.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

A Faster Isomorphism Test for Graphs of Small Degree.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Canonizing Graphs of Bounded Tree Width in Logspace.
ACM Trans. Comput. Theory, 2017

Towards an Isomorphism Dichotomy for Hereditary Graph Classes.
Theory Comput. Syst., 2017

Minimal asymmetric graphs.
J. Comb. Theory, Ser. B, 2017

Graph isomorphism for graph classes characterized by two forbidden induced subgraphs.
Discret. Appl. Math., 2017

A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Benchmark Graphs for Practical Graph Isomorphism.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Computing with Tangles.
SIAM J. Discret. Math., 2016

Detecting Similar Programs via The Weisfeiler-Leman Graph Kernel.
Proceedings of the Software Reuse: Bridging with Social-Awareness, 2016

The Graph Isomorphism Problem (Dagstuhl Seminar 15511).
Dagstuhl Reports, 2015

A Linear-Time Algorithm for Testing Outer-1-Planarity.
Algorithmica, 2015

Graphs Identified by Logics with Counting.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Isomorphism Testing for Graphs of Bounded Rank Width.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Competition Numbers, Quasi-line Graphs, and Holes.
SIAM J. Discret. Math., 2014

Switching Reconstruction of Digraphs.
J. Graph Theory, 2014

Reduction Techniques for Graph Isomorphism in the Context of Width Parameters.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Depth-First Search Using O(n) Bits.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system.
Theor. Comput. Sci., 2013

Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink.
IEEE Trans. Computers, 2013

Paging and list update under bijective analysis.
J. ACM, 2013

Iterated open neighborhood graphs and generalizations.
Discret. Appl. Math., 2013

Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Online graph exploration: New results on old and new algorithms.
Theor. Comput. Sci., 2012

On Zero Divisors with Small Support in Group Rings of Torsion-Free Groups
CoRR, 2012

Infeasible Code Detection.
Proceedings of the Verified Software: Theories, Tools, Experiments, 2012

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract).
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Weisfeiler-Lehman Graph Kernels.
J. Mach. Learn. Res., 2011

An Introduction to Certifying Algorithms.
it Inf. Technol., 2011

Certifying algorithms.
Comput. Sci. Rev., 2011

Isomorphism of (mis)Labeled Graphs.
Proceedings of the Algorithms - ESA 2011, 2011

Homomorphism-homogeneous graphs.
J. Graph Theory, 2010

Connecting face hitting sets in planar graphs.
Inf. Process. Lett., 2010

Isomorphism for Graphs of Bounded Feedback Vertex Set Number.
Proceedings of the Algorithm Theory, 2010

Progress on Certifying Algorithms.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Using the incompressibility method to obtain local lemma results for Ramsey-type problems.
Inf. Process. Lett., 2009

Counting Defective Parking Functions.
Electron. J. Comb., 2008

ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007