default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Zeman 0001
Person information
- affiliation: Technical University of Denmark, Lyngby, Denmark
- affiliation (2022 - 2023): University of Neuchâtel, Switzerland
- affiliation (PhD 2021): Charles University, Prague, Czech Republic
Other persons with the same name
- Peter Zeman 0002 — The University of Western Ontario, London, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Ken-ichi Kawarabayashi
, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphisms and Isomorphisms of Maps in Linear Time. ACM Trans. Algorithms 21(1): 6:1-6:32 (2025)- 2024
- [c10]Deniz Agaoglu Çagirici, Peter Zeman:
Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time. WALCOM 2024: 304-318 - [i14]Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman:
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability. CoRR abs/2407.10635 (2024) - 2023
- [c9]Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman:
Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS 2023: 8:1-8:14 - 2022
- [j5]Pavel Klavík, Roman Nedela, Peter Zeman:
Jordan-like characterization of automorphism groups of planar graphs. J. Comb. Theory B 157: 1-39 (2022) - [c8]Vít Kalisz, Pavel Klavík, Peter Zeman:
Circle Graph Isomorphism in Almost Linear Time. TAMC 2022: 176-188 - [c7]Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). WG 2022: 29-42 - [c6]Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman:
Extending Partial Representations of Circular-Arc Graphs. WG 2022: 230-243 - [i13]Deniz Agaoglu Çagirici, Peter Zeman:
Recognition and Isomorphism of Proper U-graphs in FPT-time. CoRR abs/2206.13372 (2022) - [i12]Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman:
Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. CoRR abs/2212.05433 (2022) - 2021
- [j4]Steven Chaplick, Martin Töpfer, Jan Voborník, Peter Zeman:
On H-Topological Intersection Graphs. Algorithmica 83(11): 3281-3318 (2021) - [j3]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. 35(2): 840-892 (2021) - [j2]Pavel Klavík, Dusan Knop, Peter Zeman:
Graph isomorphism restricted by lists. Theor. Comput. Sci. 860: 51-71 (2021) - [c5]Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphisms and Isomorphisms of Maps in Linear Time. ICALP 2021: 86:1-86:15 - [i11]Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR abs/2107.10689 (2021) - [i10]Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman:
Extending Partial Representations of Circular-Arc Graphs. CoRR abs/2108.13076 (2021) - 2020
- [c4]Pavel Klavík, Dusan Knop, Peter Zeman:
Graph Isomorphism Restricted by Lists. WG 2020: 106-118 - [i9]Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphism groups of maps in linear time. CoRR abs/2008.01616 (2020)
2010 – 2019
- 2019
- [c3]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS 2019: 296-310 - [i8]Peter Zeman:
Discrete and Fast Fourier Transform Made Clear. CoRR abs/1908.07154 (2019) - [i7]Vít Kalisz, Pavel Klavík, Peter Zeman:
Circle Graph Isomorphism in Almost Linear Time. CoRR abs/1908.09151 (2019) - 2017
- [j1]Steven Chaplick, Peter Zeman:
Combinatorial Problems on H-graphs. Electron. Notes Discret. Math. 61: 223-229 (2017) - [c2]Steven Chaplick, Martin Toepfer, Jan Voborník, Peter Zeman:
On H-Topological Intersection Graphs. WG 2017: 167-179 - [i6]Steven Chaplick, Peter Zeman:
Combinatorial Problems on $H$-graphs. CoRR abs/1706.00575 (2017) - [i5]Peter Zeman:
Extending Partial Representations of Unit Circular-arc Graphs. CoRR abs/1706.00928 (2017) - 2016
- [i4]Pavel Klavík, Dusan Knop, Peter Zeman:
Graph Isomorphism Restricted by Lists. CoRR abs/1607.03918 (2016) - [i3]Steven Chaplick, Martin Toepfer, Jan Voborník, Peter Zeman:
On H-Topological Intersection Graphs. CoRR abs/1608.02389 (2016) - 2015
- [c1]Pavel Klavík, Peter Zeman:
Automorphism Groups of Geometrically Represented Graphs. STACS 2015: 540-553 - [i2]Pavel Klavík, Peter Zeman:
Automorphism Groups of Comparability Graphs. CoRR abs/1506.05064 (2015) - 2014
- [i1]Pavel Klavík, Peter Zeman:
Automorphism Groups of Geometrically Represented Graphs. CoRR abs/1407.2136 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-26 23:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
