default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOndrej Pangrác
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Zdenek Dvorák
, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of triangle-free planar graphs. J. Graph Theory 96(4): 619-641 (2021)- 2020
- [j13]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. J. Graph Theory 95(3): 457-466 (2020)
2010 – 2019
- 2019
- [j12]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Triangle-free planar graphs with the smallest independence number. J. Graph Theory 90(3): 443-454 (2019) - [i4]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of triangle-free planar graphs. CoRR abs/1902.02971 (2019) - [i3]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of planar graphs of girth at least six. CoRR abs/1902.04069 (2019) - 2016
- [i2]Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Triangle-free planar graphs with the smallest independence number. CoRR abs/1606.06265 (2016) - 2012
- [j11]Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki:
Coloring Eulerian Triangulations of the Klein Bottle. Graphs Comb. 28(4): 499-530 (2012) - 2011
- [j10]Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác:
5-Coloring Graphs with 4 Crossings. SIAM J. Discret. Math. 25(1): 401-422 (2011) - 2010
- [j9]Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác:
Pattern Hypergraphs. Electron. J. Comb. 17(1) (2010) - [j8]Daniel Král', Serguei Norine, Ondrej Pangrác:
Markov bases of binary graph models of K4-minor free graphs. J. Comb. Theory A 117(6): 759-765 (2010) - [j7]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella:
Length-bounded cuts and flows. ACM Trans. Algorithms 7(1): 4:1-4:27 (2010)
2000 – 2009
- 2009
- [j6]Petr Kolman, Ondrej Pangrác:
On the complexity of paths avoiding forbidden pairs. Discret. Appl. Math. 157(13): 2871-2876 (2009) - [j5]Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera:
Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30(1): 53-69 (2009) - 2006
- [j4]Richard A. Brualdi, Martin Loebl, Ondrej Pangrác:
Perfect Matching Preservers. Electron. J. Comb. 13(1) (2006) - 2005
- [j3]Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss:
A note on group colorings. J. Graph Theory 50(2): 123-129 (2005) - [j2]Zdenek Dvorák, Daniel Král, Ondrej Pangrác:
Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005) - [c6]Daniel Král, Ondrej Pangrác:
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS 2005: 603-614 - 2004
- [j1]Martin Loebl, Jirí Matousek, Ondrej Pangrác:
Triangles in random graphs. Discret. Math. 289(1-3): 181-185 (2004) - [c5]Zdenek Dvorák, Daniel Král, Ondrej Pangrác:
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480 - [c4]Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247 - [i1]Zdenek Dvorák, Daniel Král, Ondrej Pangrác:
Locally consistent constraint satisfaction problems. Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [c3]Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175 - 2001
- [c2]Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác:
On Intersection Graphs of Segments with Prescribed Slopes. GD 2001: 261-271
1990 – 1999
- 1999
- [c1]Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák:
Visibility Representations of Complete Graphs. GD 1999: 333-340
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-10-07 21:18 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:
