According to our database1, Pascal Schweitzer authored at least 56 papers between 2007 and 2021.
Legend:Book In proceedings Article PhD thesis Other
Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021
ACM Trans. Algorithms, 2020
Theory Comput. Syst., 2020
Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020
Log. Methods Comput. Sci., 2019
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
An exponential lower bound for individualization-refinement algorithms for graph isomorphism.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
Theory Comput. Syst., 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
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Proceedings of the Software Reuse: Bridging with Social-Awareness, 2016
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
Proceedings of the Algorithm Theory - SWAT 2014, 2014
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
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Theor. Comput. Sci., 2012
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
Proceedings of the Algorithm Theory, 2010
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
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007