Visibility Representations of Complete Graphs. - Robert Babilon; Helena Nyklová; Ondrej Pangrác; Jan Vondrák (GD, 1999)

On Intersection Graphs of Segments with Prescribed Slopes. - Jakub Cerný; Daniel Král; Helena Nyklová; Ondrej Pangrác (GD, 2001)

Complexity of Pattern Coloring of Cycle Systems. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (WG, 2002)

Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). - Zdenek Dvorák 001; Daniel Král; Ondrej Pangrác (ICALP, 2004)

An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král; Ondrej Pangrác (SWAT, 2004)

Triangles in random graphs. - Martin Loebl; Jirí Matousek 001; Ondrej Pangrác (Discret. Math., 2004)

An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. - Daniel Král; Ondrej Pangrác (MFCS, 2005)

A note on group colorings. - Daniel Král; Ondrej Pangrác; Heinz-Jürgen Voss (J. Graph Theory, 2005)

Locally consistent constraint satisfaction problems. - Zdenek Dvorák 001; Daniel Král; Ondrej Pangrác (Theor. Comput. Sci., 2005)

Perfect Matching Preservers. - Richard A. Brualdi; Martin Loebl; Ondrej Pangrác (Electron. J. Comb., 2006)

On the complexity of paths avoiding forbidden pairs. - Petr Kolman; Ondrej Pangrác (Discret. Appl. Math., 2009)

Projective, affine, and abelian colorings of cubic graphs. - Daniel Král; Edita Mácajová; Ondrej Pangrác; André Raspaud; Jean-Sébastien Sereni; Martin Skoviera (Eur. J. Comb., 2009)

Pattern Hypergraphs. - Zdenek Dvorák 001; Jan Kára; Daniel Král'; Ondrej Pangrác (Electron. J. Comb., 2010)

Markov bases of binary graph models of K4-minor free graphs. - Daniel Král'; Serguei Norine; Ondrej Pangrác (J. Comb. Theory A, 2010)

Length-bounded cuts and flows. - Georg Baier; Thomas Erlebach; Alexander Hall; Ekkehard Köhler; Petr Kolman; Ondrej Pangrác; Heiko Schilling; Martin Skutella (ACM Trans. Algorithms, 2010)

5-Coloring Graphs with 4 Crossings. - Rok Erman; Frédéric Havet; Bernard Lidický; Ondrej Pangrác (SIAM J. Discret. Math., 2011)

Coloring Eulerian Triangulations of the Klein Bottle. - Daniel Král'; Bojan Mohar; Atsuhiro Nakamoto; Ondrej Pangrác; Yusuke Suzuki (Graphs Comb., 2012)

Triangle-free planar graphs with the smallest independence number. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2019)

Flexibility of planar graphs of girth at least six. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2020)

Flexibility of triangle-free planar graphs. - Zdenek Dvorák 001; Tomás Masarík; Jan Musílek; Ondrej Pangrác (J. Graph Theory, 2021)