HLINĚNÝ, Petr a Geoff WHITTLE. Addendum to Matroid Tree-Width. European Journal of Combinatorics. Elsevier, 2009, roč. 30, č. 4, s. 1036-1044. ISSN 0195-6698.
HLINĚNÝ, Petr a Sang-il OUM. Finding branch-decomposition and rank-decomposition. SIAM Journal on Computing. USA: SIAM, 2008, roč. 38, č. 3, s. 1012-1032. ISSN 0097-5397.
HLINĚNÝ, Petr. New infinite families of almost-planar crossing-critical graphs. Electronic Journal of Combinatorics. internet: -, 2008, roč. 15, č. 1, s. R102, 12 s. ISSN 1077-8926.
PELÁNEK, Radek. Properties of State Spaces and Their Applications. International Journal on Software Tools for Technology Transfer (STTT). Springer-Verlag GmbH, 2008, roč. 10, č. 5, s. 443-454. ISSN 1433-2779.
HLINĚNÝ, Petr. Approximating the Crossing Number for Graphs close to "Planarity". In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Abstracts collection, Dagstuhl Seminar 07281. Dagstuhl, Germany: Schloss Dagstuhl GmbH, 2007, s. 6-7. ISSN 1862-4405.
HLINĚNÝ, Petr a Sang-il OUM. Finding branch-decomposition and rank-decomposition (Extended abstract). In European Symposium on Algorithms (ESA 2007). Berlin: Springer Verlag, 2007, s. 163-174. ISBN 978-3-540-75519-7.
HLINĚNÝ, Petr. New almost-planar crossing-critical graph families. In 6th Slovenian International Conference on Graph Theory. 2007. ISBN 978-961-212-198-3.
HLINĚNÝ, Petr a Robin THOMAS. On possible counterexamples to Negami's planar cover conjecture. Journal of Graph Theory. New York: John Wiley & Sons, 2004, roč. 46, č. 3, s. 183-206. ISSN 0364-9024.