Peter Zeman

According to our database, Peter Zeman authored at least 22 papers between 2015 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Quantum polymorphism characterisation of commutativity gadgets in all quantum models.

Eric Culf, Josse van Dobben de Bruyn, Peter Zeman

CoRR, April, 2026

Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable.

Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman

Algorithmica, April, 2026

2025

Existence and nonexistence of commutativity gadgets for entangled CSPs.

Eric Culf, Josse van Dobben de Bruyn, Matthijs Vernooij, Peter Zeman

CoRR, September, 2025

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.

Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time.

Deniz Agaoglu Çagirici, Peter Zeman

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

Recognizing H-Graphs - Beyond Circular-Arc Graphs.

Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Jordan-like characterization of automorphism groups of planar graphs.

Pavel Klavík, Roman Nedela, Peter Zeman

J. Comb. Theory B, 2022

Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs.

Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman

CoRR, 2022

Recognition and Isomorphism of Proper U-graphs in FPT-time.

Deniz Agaoglu Çagirici, Peter Zeman

CoRR, 2022

Extending Partial Representations of Circular-Arc Graphs.

Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract).

Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Circle Graph Isomorphism in Almost Linear Time.

Vít Kalisz, Pavel Klavík, Peter Zeman

Proceedings of the Theory and Applications of Models of Computation, 2022

2021

Automorphisms and Isomorphisms of Maps in Linear Time.

Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Automorphism groups of maps in linear time.

Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman

CoRR, 2020

Graph Isomorphism Restricted by Lists.

Pavel Klavík, Dusan Knop, Peter Zeman

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

Discrete and Fast Fourier Transform Made Clear.

Peter Zeman

CoRR, 2019

Kernelization of Graph Hamiltonicity: Proper H-Graphs.

Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2017

Combinatorial Problems on H-graphs.

Steven Chaplick, Peter Zeman

Electron. Notes Discret. Math., 2017

Extending Partial Representations of Unit Circular-arc Graphs.

Peter Zeman

CoRR, 2017

On H-Topological Intersection Graphs.

Steven Chaplick, Martin Toepfer, Jan Voborník, Peter Zeman

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2015

Automorphism Groups of Comparability Graphs.

Pavel Klavík, Peter Zeman

CoRR, 2015

Automorphism Groups of Geometrically Represented Graphs.

Pavel Klavík, Peter Zeman

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015