Ondrej Pangrác

Publication Activity (10 Years)

Years Active: 1999-2021
Publications (10 Years): 6

Top Topics

Belief Propagation

Graphical Models

Top Venues

J. Graph Theory

Publications

Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Flexibility of triangle-free planar graphs. J. Graph Theory 96 (4) (2021)
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) (2020)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Flexibility of planar graphs of girth at least six. CoRR (2019)
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) (2019)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Flexibility of triangle-free planar graphs. CoRR (2019)
Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác
Triangle-free planar graphs with the smallest independence number. CoRR (2016)
Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki
Coloring Eulerian Triangulations of the Klein Bottle. Graphs Comb. 28 (4) (2012)
Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác
5-Coloring Graphs with 4 Crossings. SIAM J. Discret. Math. 25 (1) (2011)
Zdenek Dvorák, Jan Kára, Daniel Král', Ondrej Pangrác
Pattern Hypergraphs. Electron. J. Comb. 17 (1) (2010)
Daniel Král', Serguei Norine, Ondrej Pangrác
-minor free graphs. J. Comb. Theory, Ser. A 117 (6) (2010)
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) (2010)
Petr Kolman, Ondrej Pangrác
On the complexity of paths avoiding forbidden pairs. Discret. Appl. Math. 157 (13) (2009)
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) (2009)
Richard A. Brualdi, Martin Loebl, Ondrej Pangrác
Perfect Matching Preservers. Electron. J. Comb. 13 (1) (2006)
Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss
A note on group colorings. J. Graph Theory 50 (2) (2005)
Zdenek Dvorák, Daniel Král, Ondrej Pangrác
Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348 (2-3) (2005)
Daniel Král, Ondrej Pangrác
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS (2005)
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT (2004)
Martin Loebl, Jirí Matousek, Ondrej Pangrác
Triangles in random graphs. Discret. Math. 289 (1-3) (2004)
Zdenek Dvorák, Daniel Král, Ondrej Pangrác
Locally consistent constraint satisfaction problems Electron. Colloquium Comput. Complex. (051) (2004)
Zdenek Dvorák, Daniel Král, Ondrej Pangrác
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP (2004)
Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác
Complexity of Pattern Coloring of Cycle Systems. WG (2002)
Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác
On Intersection Graphs of Segments with Prescribed Slopes. Graph Drawing (2001)
Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák
Visibility Representations of Complete Graphs. Graph Drawing (1999)