Moritz Lichter

31 papers A* 7A 1B 4Journal 19

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Weisfeiler-Leman on graphs of small twin-width. CoRR Irene Heinrich, Moritz Lichter, Klara Pakhomenko, Simon Raßmann
2025	J	`jnl`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. J. ACM Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2025	B	`conf`	Computational Complexity of the Weisfeiler-Leman Dimension. CSL Moritz Lichter, Simon Raßmann, Pascal Schweitzer
2025	A*	`conf`	Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. ICALP Moritz Lichter, Benedikt Pago
2025	B	`conf`	Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. MFCS Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth
2025	J	`jnl`	The Iteration Number of the Weisfeiler-Leman Algorithm. ACM Trans. Comput. Log. Martin Grohe, Moritz Lichter, Daniel Neuen
2024	J	`jnl`	Choiceless Polynomial Time with Witnessed Symmetric Choice. J. ACM Moritz Lichter, Pascal Schweitzer
2024	J	`jnl`	Computational complexity of the Weisfeiler-Leman dimension. CoRR Moritz Lichter, Simon Raßmann, Pascal Schweitzer
2024	J	`jnl`	Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. CoRR Moritz Lichter, Benedikt Pago
2024	B	`conf`	Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. CSL Moritz Lichter, Benedikt Pago, Tim Seppelt
2024	J	`jnl`	Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. CoRR Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth
2023	A*	`conf`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2023	J	`jnl`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2023	J	`jnl`	Limitations of Game Comonads via Homomorphism Indistinguishability. CoRR Moritz Lichter, Benedikt Pago, Tim Seppelt
2023	J	`jnl`	Limitations of the invertible-map equivalences. J. Log. Comput. Anuj Dawar, Erich Grädel, Moritz Lichter
2023	J	`jnl`	Separating Rank Logic from Polynomial Time. J. ACM Moritz Lichter
2023	A*	`conf`	The Iteration Number of the Weisfeiler-Leman Algorithm. LICS Martin Grohe, Moritz Lichter, Daniel Neuen
2023	J	`jnl`	The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR Martin Grohe, Moritz Lichter, Daniel Neuen
2023	A*	`conf`	Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. ICALP Moritz Lichter
2022	A*	`conf`	Choiceless Polynomial Time with Witnessed Symmetric Choice. LICS Moritz Lichter, Pascal Schweitzer
2022	J	`jnl`	Choiceless Polynomial Time with Witnessed Symmetric Choice. CoRR Moritz Lichter, Pascal Schweitzer
2022	J	`jnl`	Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting. CoRR Moritz Lichter
2021	B	`conf`	Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CSL Moritz Lichter, Pascal Schweitzer
2021	J	`jnl`	Limitations of the Invertible-Map Equivalences. CoRR Anuj Dawar, Erich Grädel, Moritz Lichter
2021	A*	`conf`	Separating Rank Logic from Polynomial Time. LICS Moritz Lichter
2021	J	`jnl`	Separating Rank Logic from Polynomial Time. CoRR Moritz Lichter
2020	J	`jnl`	Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time. CoRR Moritz Lichter, Pascal Schweitzer
2019	A*	`conf`	Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. LICS Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
2019	J	`jnl`	Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm. CoRR Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
2018	J	`jnl`	Constructive Analysis of S1S and Büchi Automata. CoRR Moritz Lichter, Gert Smolka
2015	A	`conf`	A sound and optimal incremental build system with dynamic dependencies. OOPSLA Sebastian Erdweg, Moritz Lichter, Manuel Weiel