default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Pergel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i7]Irina Mustata, Martin Pergel:
What Makes the Recognition Problem Hard for Classes Related to Segment and String graphs? CoRR abs/2201.08498 (2022)- [i6]Jessica A. Enright, Martin Pergel:
Recognising the overlap graphs of subtrees of restricted trees is hard. CoRR abs/2202.01678 (2022) - 2021
- [j7]Marcel Milich, Torsten Mütze
, Martin Pergel:
On flips in planar matchings. Discret. Appl. Math. 289: 427-445 (2021) - 2020
- [c9]Marcel Milich, Torsten Mütze, Martin Pergel:
On Flips in Planar Matchings. WG 2020: 213-225 - [i5]Marcel Milich, Torsten Mütze, Martin Pergel:
On flips in planar matchings. CoRR abs/2002.02290 (2020)
2010 – 2019
- 2018
- [j6]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic polygons and beyond: Maximal cliques in intersection graphs. Discret. Appl. Math. 247: 263-277 (2018) - 2017
- [j5]Martin Pergel, Pawel Rzazewski:
On edge intersection graphs of paths with 2 bends. Discret. Appl. Math. 226: 106-116 (2017) - [j4]Stefan Felsner, Irina Mustata, Martin Pergel:
The Complexity of the Partial Order Dimension Problem: Closing the Gap. SIAM J. Discret. Math. 31(1): 172-189 (2017) - [i4]Martin Pergel, Pawel Rzazewski:
On edge intersection graphs of paths with 2 bends. CoRR abs/1711.05096 (2017) - 2016
- [c8]Martin Pergel, Pawel Rzazewski:
On Edge Intersection Graphs of Paths with 2 Bends. WG 2016: 207-219 - 2015
- [i3]Martin Pergel:
A Note on Graphs with 2 Bends. CoRR abs/1510.00684 (2015) - 2014
- [j3]Cyril Brom, Edita Bromová, Filip Dechterenko, Michaela Buchtová, Martin Pergel:
Personalized messages in a brewery educational simulation: Is the personalization principle less robust than previously thought? Comput. Educ. 72: 339-366 (2014) - [i2]Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. CoRR abs/1411.2928 (2014) - 2013
- [i1]Irina Mustata, Martin Pergel:
Unit Grid Intersection Graphs: Recognition and Properties. CoRR abs/1306.1855 (2013) - 2012
- [c7]Cyril Brom, Edita Bromová, Martin Pergel:
Towards a Brewery Educational Game: Would Existence of a Game Goal Improve Learning? ICEC 2012: 389-392 - [c6]Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski:
Beyond Homothetic Polygons: Recognition and Maximum Clique. ISAAC 2012: 619-628
2000 – 2009
- 2009
- [j2]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. 13(3): 379-422 (2009) - 2008
- [j1]Jan Kratochvíl, Martin Pergel:
Intersection graphs of homothetic polygons. Electron. Notes Discret. Math. 31: 277-280 (2008) - [c5]Stefan Felsner, Martin Pergel:
The Complexity of Sorting with Networks of Stacks and Queues. ESA 2008: 417-429 - 2007
- [c4]Jan Kratochvíl, Martin Pergel:
Geometric Intersection Graphs: Do Short Cycles Help? COCOON 2007: 118-128 - [c3]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs. GD 2007: 303-314 - [c2]Martin Pergel:
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. WG 2007: 238-247 - 2003
- [c1]Jan Kratochvíl, Martin Pergel:
Two Results on Intersection Graphs of Polygons. GD 2003: 59-70
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 2024-05-08 21:00 CEST 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:
