Complete scientific publication list

Since this page is just a boring and rather long list, better look at the recent scientific results of our research group...

articles
Prof. RNDr. Petr Hliněný, Ph.D.

@ynenilhfi.muni.cz
Faculty of Informatics MU Brno, CZ

All scientific papers by Petr Hliněný

  1. 2017:   A Short Proof of Euler-Poincaré Formula.  manuscript (2017), 5 p.   URL: arxiv.org/abs/1612.01271.
  2. 2017 (co-authors R. Ganian, J. Nešetřil, J. Obdržálek, P. Ossona de Mendez):   Shrub-depth: Capturing Height of Dense Graphs.  Submitted (2017), 26 p.   URL: arxiv.org/abs/1707.00359.
  3. 2017 (co-author C. Thomassen):   Deciding Parity of Graph Crossing Number.  Submitted (2017), 4 p.   Preprint/file.
  4. 2017 (co-authors J. Gajarský, M. Koutecký, S. Onn):   Parameterized Shifted Combinatorial Optimization.  Submitted (2017), 20 p.   URL: arxiv.org/abs/1702.06844.
  5. 2017:   Simpler Self-reduction Algorithm for Matroid Path-width.  Submitted (2017), 15 p.   URL: arxiv.org/abs/1605.09520.
  6. 2016 (co-authors J. Gajarský, D. Lokshtanov, J. Obdržálek, S. Ordyniak, M.S. Ramanujan, S. Saurabh):   FO Model Checking on Posets of Bounded Width.  Submitted (2016), 16 p.   URL: arxiv.org/abs/1504.04115.
  7. 2014 (co-authors M. Chimani, G. Salazar):   Toroidal Grid Minors and Stretch in Embedded Graphs.  Submitted (2014), 40 p.   URL: arxiv.org/abs/1403.1273.
  8. 2017 (co-authors F. Pokrývka, B. Roy):   FO model checking of geometric graphs.  In: IPEC 2017 (2017), to appear.   URL: arxiv.org/abs/1709.03701.
  9. 2017 (co-authors J. Gajarský, M. Koutecký, S. Onn):   Parameterized Shifted Combinatorial Optimization.  In: COCOON 2017, Lecture Notes in Computer Science 10392, Springer (2017), 224-236.   URL: arxiv.org/abs/1702.06844. DOI 10.1007/978-3-319-62389-4_19. © Springer-Verlag.
  10. 2017 (co-authors J. Gajarský, H.R. Tiwary):   Parameterized Extension Complexity of Independent Set and Related Problems.  Discrete Applied Mathematics (2017), to appear.   URL: arxiv.org/abs/1511.08841. DOI 10.1016/j.dam.2017.04.042. © Elsevier B.V.
  11. 2017 (co-authors J. Gajarský, T. Kaiser, D. Král', M. Kupec, J. Obdržálek, S. Ordyniak, V. Tuma):   First order limits of sparse graphs: Plane trees and path-width.  Random Structures & Algorithms 50 (2017), 612-635.   URL: arxiv.org/abs/1504.08122. DOI 10.1002/rsa.20676. © John Wiley & Sons, Inc.
  12. 2017 (co-author M. Chimani):   A Tighter Insertion-based Approximation of the Crossing Number.  Journal of Combinatorial Optimization 33 (2017), 1183-1225.   URL: arxiv.org/abs/1104.5039. DOI 10.1007/s10878-016-0030-z. © Elsevier B.V.
  13. 2017 (co-authors J. Gajarský, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Sánchez Villaamil, S. Sikdar):   Kernelization Using Structural Parameters on Sparse Graph Classes.  Journal of Computer and System Sciences 84 (2017), 219-242.   URL: arxiv.org/abs/1302.6863. DOI 10.1016/j.jcss.2016.09.002. © Elsevier B.V.
  14. 2016 (co-authors J. Gajarský, D. Lokshtanov, J. Obdržálek, M.S. Ramanujan):   A New Perspective on FO Model Checking of Dense Graph Classes.  In: LICS 2016, ACM (2016), 176-184.   DOI 10.1145/2933575.2935314. Preprint/file.
  15. 2016 (co-authors O. Kwon, J. Obdržálek, S. Ordyniak):   Tree-depth and Vertex-minors.  European J. Combinatorics 56 (2016), 46-56.   URL: arxiv.org/abs/1403.7024. DOI 10.1016/j.ejc.2016.03.001. © Elsevier B.V.
  16. 2016 (co-author M. Derňár):   Crossing Number is Hard for Kernelization.  In: SoCG 2016, LIPIcs Vol. 51, Dagstuhl (2016), 42:1-42:10.   URL: arxiv.org/abs/1512.02379. DOI 10.4230/LIPIcs.SoCG.2016.42.
  17. 2016 (co-author M. Chimani):   Inserting Multiple Edges into a Planar Graph.  In: SoCG 2016, LIPIcs Vol. 51, Dagstuhl (2016), 30:1-30:15.   URL: arxiv.org/abs/1509.07952. DOI 10.4230/LIPIcs.SoCG.2016.30.
  18. 2016 (co-authors R. Ganian, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith, S. Sikdar):   Are there any good digraph width measures?.  J. of Combinatorial Theory ser. B 116 (2016), 250-286.   URL: arxiv.org/abs/1004.1485. DOI 10.1016/j.jctb.2015.09.001. © Elsevier B.V.
  19. 2016 (co-author O. Slámečka):   Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs.  In: MEMICS 2015, Lecture Notes in Computer Science 9548, Springer (2016), 75-86.   DOI 10.1007/978-3-319-29817-7_6. © Springer-Verlag.
  20. 2015 (co-authors M.Bračič, D. Bokal, M. Derňár):   On Degree Properties of Crossing-critical Families of Graphs.  In: Graph Drawing 2015, Lecture Notes in Computer Science 9411, Springer (2015), 75-86.   DOI 10.1007/978-3-319-27261-0_7. © Springer-Verlag. Preprint/file.
  21. 2015 (co-authors J. Gajarský, D. Lokshtanov, J. Obdržálek, S. Ordyniak, M.S. Ramanujan, S. Saurabh):   FO Model Checking on Posets of Bounded Width.  In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, IEEE (2015), 963-974.   URL: arxiv.org/abs/1504.04115. DOI 10.1109/FOCS.2015.63.
  22. 2015 (co-authors R. Ganian, D. Král', J. Obdržálek, J. Schwartz, J. Teska):   FO Model Checking of Interval Graphs.  Logical Methods in Computer Science 11(4) (2015), paper 11.   URL: arxiv.org/abs/1302.6043. DOI 10.2168/LMCS-11(4:11)2015.
  23. 2015 (co-authors J. Gajarský, J. Obdržálek, S. Ordyniak):   Faster Existential FO Model Checking on Posets.  Logical Methods in Computer Science 11(4) (2015), paper 8.   URL: arxiv.org/abs/1409.4433. DOI 10.2168/LMCS-11(4:8)2015.
  24. 2015 (co-author G. Salazar):   On Hardness of the Joint Crossing Number.  In: ISAAC 2015, Lecture Notes in Computer Science 9472, Springer (2015), 603-613.   URL: arxiv.org/abs/1509.01787. DOI 10.1007/978-3-662-48971-0_51. © Springer-Verlag.
  25. 2015 (co-author J. Gajarský):   Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences.  Logical Methods in Computer Science 11(1) (2015), paper 19.   URL: arxiv.org/abs/1204.5194. DOI 10.2168/LMCS-11(1:19)2015.
  26. 2015 (co-author M. Derka):   Planar Emulators Conjecture Is Nearly True for Cubic Graphs.  European J. Combinatorics 48 (2015), 63-70.   DOI 10.1016/j.ejc.2015.02.009. © Elsevier B.V. Preprint/file.
  27. 2014 (co-authors J. Gajarský, J. Obdržálek, S. Ordyniak):   Faster Existential FO Model Checking on Posets.  In: ISAAC 2014, Lecture Notes in Computer Science 8889, Springer (2014), 441-451.   URL: arxiv.org/abs/1409.4433. DOI 10.1007/978-3-319-13075-0_35. © Springer-Verlag.
  28. 2014 (co-authors S. Cabello, M. Chimani):   Computing the stretch of an embedded graph.  SIAM J. Discrete Mathematics 28 (2014), 1391-1401.   URL: www.fmf.uni-lj.si/~cabello/publications/cch-stretch-2013.pdf. DOI 10.1137/130945636. © Society for Industrial and Applied Mathematics.
  29. 2014 (co-authors R. Ganian, J. Kneis, A. Langer, J. Obdržálek, P. Rossmanith):   Digraph Width Measures in Parameterized Algorithmics.  Discrete Applied Mathematics 168 (2014), 88-107.   DOI 10.1016/j.dam.2013.10.038. © Springer-Verlag. Preprint/file.
  30. 2014 (co-authors R. Ganian, A. Langer, J. Obdržálek, P. Rossmanith, S. Sikdar):   Lower Bounds on the Complexity of MSO1 Model-Checking.  Journal of Computer and System Sciences 80 (2014), 180-194.   URL: arxiv.org/abs/1109.5804. DOI 10.1016/j.jcss.2013.07.005. © Elsevier B.V.
  31. 2013 (co-authors J. Gajarský, J. Obdržálek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Sánchez Villaamil, S. Sikdar):   Kernelization Using Structural Parameters on Sparse Graph Classes.  In: ESA 2013, Lecture Notes in Computer Science 8125, Springer (2013), 529-540.   URL: arxiv.org/abs/1302.6863. DOI 10.1007/978-3-642-40450-4_45. © Springer-Verlag.
  32. 2013 (co-author M. Derka):   Planar Emulators Conjecture Is Nearly True for Cubic Graphs.  In: Eurocomb 2013, Pisa Italy, Proceedings (2013), 245-250.   Preprint/file.
  33. 2013 (co-authors S. Cabello, M. Chimani):   Computing the stretch of an embedded graph.  In: XV Spanish Meeting on Computational Geometry 2013, Seville Spain, Proceedings (2013), 39-42.   URL: congreso.us.es/ecgeometry/proceedingsECG2013.pdf.
  34. 2013 (co-authors R. Ganian, D. Král', J. Obdržálek, J. Schwartz, J. Teska):   FO Model Checking of Interval Graphs.  In: ICALP 2013, Lecture Notes in Computer Science 7966, Springer (2013), 250-262.   URL: arxiv.org/abs/1302.6043. DOI 10.1007/978-3-642-39212-2_24. © Springer-Verlag.
  35. 2013 (co-authors R. Ganian, J. Obdržálek):   Better algorithms for satisfiability problems for formulas of bounded rank-width.  Fundamenta Informaticae 123 (2013), 59-76.   URL: arxiv.org/abs/1006.5621. DOI 10.3233/FI-2013-800.
  36. 2013 (co-authors R. Ganian, J. Obdržálek):   Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width.  European J. Combinatorics 34 (2013), 680-701.   DOI 10.1016/j.ejc.2012.07.024. © Elsevier B.V. Preprint/file.
  37. 2013 (co-authors M. Chimani, M. Derka, M. Klusáček):   How Not to Characterize Planar-emulable Graphs.  Advances in Applied Mathematics 50 (2013), 46-68.   URL: arxiv.org/abs/1107.0176. DOI 10.1016/j.aam.2012.06.004. © Elsevier B.V. Addendum.
  38. 2012 (co-author J. Gajarský):   Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences.  In: FSTTCS 2012, Leibniz International Proceedings in Informatics LIPIcs, Vol. 18, Dagstuhl (2012), 112-123.   URL: arxiv.org/abs/1204.5194. DOI 10.4230/LIPIcs.FSTTCS.2012.112.
  39. 2012 (co-authors R. Ganian, J. Nešetřil, J. Obdržálek, P. Ossona de Mendez, R. Ramadurai):   When Trees Grow Low: Shrubs and Fast MSO1.  In: Math Foundations of Computer Science MFCS 2012, Lecture Notes in Computer Science 7464, Springer (2012), 419-430.   DOI 10.1007/978-3-642-32589-2_38. © Springer-Verlag. Preprint/file.
  40. 2012 (co-author O. Moriš):   Generalized Maneuvers in Route Planning.  Computing and Informatics 31 (2012), 531-549.   URL: www.cai.sk/ojs/index.php/cai/article/view/1007.
  41. 2012 (co-authors R. Ganian, A. Langer, J. Obdržálek, P. Rossmanith, S. Sikdar):   Lower Bounds on the Complexity of MSO1 Model-Checking.  In: Symposium on Theoretical Aspects of Computer Science STACS 2012, Leibniz International Proceedings in Informatics LIPIcs Vol 14, Dagstuhl (2012), 326-337.   URL: arxiv.org/abs/1109.5804. DOI 10.4230/LIPIcs.STACS.2012.326.
  42. 2012 (co-author O. Moriš):   Generalized Maneuvers in Route Planning.  In: MEMICS 2011, Lecture Notes in Computer Science 7119, Springer (2012), 155-166.   DOI 10.1007/978-3-642-25929-6_15. © Springer-Verlag.
  43. 2012 (co-authors M. Chimani, P. Mutzel):   Vertex Insertion approximates the Crossing Number for Apex Graphs.  European J. Combinatorics 33 (2012), 326-335.   DOI 10.1016/j.ejc.2011.09.009. © Elsevier B.V. Preprint/file.
  44. 2011 (co-authors M. Chimani, M. Derka, M. Klusáček):   How Not to Characterize Planar-emulable Graphs.  In: IWOCA 2011, Lecture Notes in Computer Science 7056, Springer (2011), 106-120.   URL: arxiv.org/abs/1107.0176. DOI 10.1007/978-3-642-25011-8_9. © Springer-Verlag.
  45. 2011 (co-author O. Moriš):   Scope-based route planning.  In: ESA 2011, Lecture Notes in Computer Science 6942, Springer (2011), 445-456.   URL: arxiv.org/abs/1101.3182. DOI 10.1007/978-3-642-23719-5_38. © Springer-Verlag.
  46. 2011 (co-authors E. Jelínková, J. Kratochvíl, O. Suchý):   Parameterized Problems Related to Seidel's Switching.  Discrete Mathematics & Theoretical Computer Science 13 (2011), 19-44.   URL: www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1531.
  47. 2011 (co-author M. Chimani):   A Tighter Insertion-based Approximation of the Crossing Number.  In: ICALP 2011, Part I, Lecture Notes in Computer Science 6755, Springer (2011), 122-134.   DOI 10.1007/978-3-642-22006-7_11. © Springer-Verlag.
  48. 2011 (co-authors R. Ganian, J. Obdržálek):   Clique-width: When Hard Does Not Mean Impossible.  In: Symposium on Theoretical Aspects of Computer Science STACS 2011, Leibniz International Proceedings in Informatics LIPIcs Vol 9, Dagstuhl (2011), 404-415.   URL: drops.dagstuhl.de/opus/volltexte/2011/3030. DOI 10.4230/LIPIcs.STACS.2011.404.
  49. 2010 (co-authors R. Ganian, J. Obdržálek):   Better algorithms for satisfiability problems for formulas of bounded rank-width.  In: FSTTCS 2010, Leibniz International Proceedings in Informatics LIPIcs, Vol. 8, Dagstuhl (2010), 73-83.   URL: arxiv.org/abs/1006.5621. DOI 10.4230/LIPIcs.FSTTCS.2010.73.
  50. 2010 (co-authors R. Ganian, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith, S. Sikdar):   Are there any good digraph width measures?.  In: IPEC 2010, Lecture Notes in Computer Science 6478, Springer Verlag (2010), 135-146.   URL: arxiv.org/abs/1004.1485v1. DOI 10.1007/978-3-642-17493-3_14. © Springer-Verlag.
  51. 2010:   20 Years of Negami's Planar Cover Conjecture.  Graphs and Combinatorics 26 (2010), 525-536.   DOI 10.1007/s00373-010-0934-9. © Springer-Verlag. Preprint/file. Addendum.
  52. 2010 (co-author G. Salazar):   Stars and Bonds in Crossing-Critical Graphs.  Journal of Graph Theory 65 (2010), 198-215.   DOI 10.1002/jgt.20473. © John Wiley & Sons, Inc. Preprint/file.
  53. 2010 (co-author R. Ganian):   On Parse Trees and Myhill-Nerode-type Tools for handling Graphs of Bounded Rank-width.  Discrete Applied Mathematics 158 (2010), 851-867.   DOI 10.1016/j.dam.2009.10.018. © Elsevier B.V. Preprint/file.
  54. 2010 (co-author R. Ganian):   New results on the complexity of oriented colouring on restricted digraph classes.  In: SOFSEM 2010, Lecture Notes in Computer Science 5901 (2010), 428-439.   DOI 10.1007/978-3-642-11266-9_36. © Springer-Verlag. Preprint/file.
  55. 2010 (co-author M. Chimani):   Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface.  In: Symposium on Discrete Algorithms SODA 2010, ACM-SIAM (2010), 918-927.   URL: www.siam.org/proceedings/soda/2010/soda10.php. © Society for Industrial and Applied Mathematics. Preprint/file.
  56. 2009 (co-authors R. Ganian, J. Kneis, A. Langer, J. Obdržálek, P. Rossmanith):   On Digraph Width Measures in Parameterized Algorithmics (extended abstract).  In: IWPEC 2009, Lecture Notes in Computer Science 5917, Springer (2009), 185-197.   DOI 10.1007/978-3-642-11269-0_15. © Springer-Verlag. Preprint/file.
  57. 2009 (co-author R. Ganian):   Better Polynomial Algorithms on Graphs of Bounded Rank-width.  In: IWOCA 2009, Lecture Notes in Computer Science 5874, Springer (2009), 266-277.   DOI 10.1007/978-3-642-10217-2_27. © Springer-Verlag. Preprint/file.
  58. 2009 (co-author G. Whittle):   Addendum to Matroid Tree-Width.  European J. Combinatorics 30 (2009), 1036-1044.   DOI 10.1016/j.ejc.2008.09.028. © Elsevier B.V. Preprint/file.
  59. 2009 (co-authors M. Chimani, P. Mutzel):   Approximating the Crossing Number of Apex Graphs.  In: Graph Drawing 2008, Lecture Notes in Computer Science 5417, Springer Verlag (2009), 432-434.   DOI 10.1007/978-3-642-00219-9_42. © Springer-Verlag.
  60. 2008:   New infinite families of almost-planar crossing-critical graphs.  Electronic Journal of Combinatorics 15 (2008), #R102.   URL: www.combinatorics.org/Volume_15/PDF/v15i1r102.pdf.
  61. 2008 (co-author R. Ganian):   Automata Approach to Graphs of Bounded Rank-width.  In: IWOCA 2008, Proceedings, 4-15.   Preprint/file.
  62. 2008 (co-author S. Oum):   Finding Branch-decompositions and Rank-decompositions.  SIAM J. Computing 38 (2008), 1012-1032.   DOI 10.1137/070685920. © Society for Industrial and Applied Mathematics. Preprint/file.
  63. 2008 (co-authors I. Gitler, J. Leanos, G. Salazar):   The crossing number of a projective graph is quadratic in the face-width.  Electr. Journal of Combinatorics 15 (2008), www.combinatorics.org, #R46.   URL: www.combinatorics.org/Volume_15/PDF/v15i1r46.pdf.
  64. 2008 (co-author G. Salazar):   Stars and Bonds in Crossing-Critical Graphs (extended abstract).  In: TGGT 2008 (Paris), Electronic Notes in Discrete Mathematics 31, Elsevier (2008), 271-275.   DOI 10.1016/j.endm.2008.06.055. © Elsevier B.V. Preprint/file.
  65. 2008 (co-authors G. Gottlob, S. Oum, D. Seese):   Width Parameters Beyond Tree-width and Their Applications.  Invited survey paper, Computer Journal 51 (2008), 326-362.   DOI 10.1093/comjnl/bxm052. © Oxford University Press. Preprint/file.
  66. 2007 (co-author G. Salazar):   Approximating the Crossing Number of Toroidal Graphs.  In: ISAAC 2007, Lecture Notes in Computer Science 4835, Springer Verlag (2007), 148-159.   DOI 10.1007/978-3-540-77120-3_15. © Springer-Verlag. Preprint/file.
  67. 2007:   Combinatorial Generation of Matroid Representations: Theory and Practice.  In: Proceedings of the 3rd Asian Applied Computing Conference, Kathmandu, Nepal, December 10-12, 2005, Advances in Computer Science and Engineering: Reports and Monographs - Vol. 2, Imperial College Press, 2007, 3-7.
  68. 2007 (co-author S. Oum):   Finding branch-decompositions and rank-decompositions (extended abstract).  In: ESA 2007, Lecture Notes in Computer Science 4698, Springer Verlag (2007), 163-174.   DOI 10.1007/978-3-540-75520-3_16. © Springer-Verlag. Preprint/file.
  69. 2007 (co-authors I. Gitler, J. Leanos, G. Salazar):   The crossing number of a projective graph is quadratic in the face-width (extended abstract).  In: EUROCOMB 2007, Electronic Notes in Discrete Mathematics 29C, Elsevier (2007), 219-223.   DOI 10.1016/j.endm.2007.07.037. © Elsevier B.V. Preprint/file.
  70. 2007:   Some Hard Problems on Matroid Spikes.  Theory of Computing Systems 41 (2007), 551-562.   DOI 10.1007/s00224-007-1307-5. © Springer-Verlag. Preprint/file.
  71. 2007 (co-author G. Salazar):   On the Crossing Number of Almost Planar Graphs.  In: Graph Drawing GD 2006, Lecture Notes in Computer Science 4372, Springer Verlag (2007), 162-173.   DOI 10.1007/978-3-540-70904-6_17. © Springer-Verlag. Preprint/file.
  72. 2006 (co-authors O. Gimenez, M. Noy):   Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.  SIAM J. Discrete Math 20 (2006), 932-946.   DOI 10.1137/050645208. © Society for Industrial and Applied Mathematics. Preprint/file.
  73. 2006 (co-author G. Whittle):   Matroid Tree-Width.  European J. Combinatorics 27 (2006), 1117-1128.   DOI 10.1016/j.ejc.2006.06.005. © Elsevier B.V. Preprint/file. Addendum.
  74. 2006:   On Matroid Representability and Minor Problems.  In: Math Foundations of Computer Science MFCS 2006, Lecture Notes in Computer Science 4162, Springer Verlag (2006), 505-516.   DOI 10.1007/11821069_44. © Springer-Verlag. Preprint/file.
  75. 2006 (co-authors L.A. Goddyn, W. Hochstaettler):   Balanced Signings and the Chromatic Number of Oriented Matroids.  Combinatorics Probability Computing 15 (2006), 523-539.   DOI 10.1017/S096354830500742X. © Cambridge University Press. Preprint/file.
  76. 2006:   The Tutte Polynomial for Matroids of Bounded Branch-Width.  Combinatorics Probability Computing 15 (2006), 397-409.   DOI 10.1017/S0963548305007297. © Cambridge University Press. Preprint/file.
  77. 2006:   Crossing Number is Hard for Cubic Graphs.  J. of Combinatorial Theory ser. B 96 (2006), 455-471.   DOI 10.1016/j.jctb.2005.09.009. © Elsevier B.V. Preprint/file.
  78. 2006:   Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids.  J. of Combinatorial Theory ser. B 96 (2006), 325-351.   DOI 10.1016/j.jctb.2005.08.005. © Elsevier B.V. Preprint/file.
  79. 2006:   Equivalence-free exhaustive generation of matroid representations.  Discrete Applied Mathematics 154 (2006), 1210-1222.   DOI 10.1016/j.dam.2005.12.001. © Elsevier B.V. Preprint/file.
  80. 2006 (co-author D. Seese):   Trees, Grids, and MSO Decidability: from Graphs to Matroids.  Theor. Computer Science 351 (2006), 372-393.   DOI 10.1016/j.tcs.2005.10.006. © Elsevier B.V. Preprint/file.
  81. 2005:   Combinatorial Generation of Matroid Representations: Theory and Practice.  Acta Math. Univ. M. Belii 12 (2005), 31-41.   URL: actamath.savbb.sk/html/acta12.html.
  82. 2005 (co-authors O. Gimenez, M. Noy):   Computing the Tutte Polynomial on Graphs of Bounded Clique-Width (extended abstract).  In: Proceedings WG 2005, Lecture Notes in Computer Science 3787, Springer Verlag (2005), 59-68.   DOI 10.1007/11604686_6. © Springer-Verlag. Preprint/file.
  83. 2005:   A Parametrized Algorithm for Matroid Branch-Width.  SIAM J. Computing 35 (2005), 259-277.   DOI 10.1137/S0097539702418589. © Society for Industrial and Applied Mathematics. Preprint/file.
  84. 2005 (co-authors J.F. Geelen, G. Whittle):   Bridging Separations in Matroids.  SIAM J. Discrete Mathematics 18 (2005), 638-646.   DOI 10.1137/S089548010139638X. © Society for Industrial and Applied Mathematics.
  85. 2004:   Using a Computer in Matroid Theory Research.  Acta Math. Univ. M. Belii 11 (2004), 27-44.   URL: actamath.savbb.sk/html/acta11.html.
  86. 2004 (co-author D. Seese):   On Decidability of MSO Theories of Representable Matroids.  In: IWPEC 2004 Proceedings, Lecture Notes in Computer Science 3162, Springer Verlag (2004), 96-107.   DOI 10.1007/b100584. © Springer-Verlag. Preprint/file.
  87. 2004:   Crossing Number is Hard for Cubic Graphs (extended abstract).  In: Math Foundations of Computer Science MFCS 2004, Lecture Notes in Computer Science 3153, Springer Verlag (2004), 772-782.   DOI 10.1007/b99679. © Springer-Verlag. Preprint/file.
  88. 2004 (co-author R. Thomas):   On possible counterexamples to Negami's planar cover conjecture.  Journal of Graph Theory 46 (2004), 183-206.   DOI 10.1002/jgt.10177. © John Wiley & Sons, Inc. Preprint/file. Addendum.
  89. 2003:   A new Proof for Chordal Graphs.  Acta Math. Univ. M. Belii 10 (2003), 17-19.   URL: actamath.savbb.sk/html/acta10.html.
  90. 2003:   On Matroid Properties Definable in the MSO Logic.  In: Math Foundations of Computer Science MFCS 2003, Lecture Notes in Computer Science 2747, Springer Verlag (2003), 470-479.   DOI 10.1007/b11836. © Springer-Verlag. Preprint/file.
  91. 2003:   Crossing-Number Critical Graphs have Bounded Path-Width.  J. of Combinatorial Theory ser. B 88 (2003), 347-367.   DOI 10.1016/S0095-8956(03)00037-6. © Elsevier B.V. Preprint/file.
  92. 2003:   Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids (extended Abstract).  In: Theoretical Aspects of Computer Science STACS 2003, Lecture Notes in Computer Science 2607, Springer Verlag (2003), 319-330.   URL: www.springerlink.com/content/pepbrkuctey7m0wn. © Springer-Verlag.
  93. 2003 (co-author G. Whittle):   Tree-Width and Matroids (extended abstract).  In: EUROCOMB 2003, ITI Series 2003-145, MFF Charles University, Prague (2003), 5 p.   URL: iti.mff.cuni.cz/series/index2003.html.
  94. 2002:   On the Excluded Minors for Matroids of Branch-Width Three.  Electr. Journal of Combinatorics 9 (2002), www.combinatorics.org, #R32.   URL: www.combinatorics.org/Volume_9/PDF/v9i1r32.pdf.
  95. 2002:   Crossing-Critical Graphs and Path-Width.  In: Graph Drawing GD 2001, Lecture Notes in Computer Science 2265, Springer Verlag (2002), 102-114.   URL: www.springerlink.com/content/42vefrkfu4mjyu1r. © Springer-Verlag.
  96. 2001:   Another two graphs with no planar covers.  Journal of Graph Theory 37 (2001), 227-242.   DOI 10.1002/jgt.1018. © John Wiley & Sons, Inc. Preprint/file.
  97. 2001:   An Addition to Art Galleries with Interior Walls.  Discrete Computational Geometry 25 (2001), 311-314.   URL: www.springerlink.com/content/xem4gbwnt8k2q30t.
  98. 2001:   Contact graphs of line segments are NP-complete.  Discrete Mathematics 235 (2001), 95-106.   DOI 10.1016/S0012-365X(00)00263-6. © Elsevier B.V. Preprint/file.
  99. 2001 (co-author J. Kratochvíl):   Representing graphs by disks and balls (a survey of recognition complexity results).  Discrete Mathematics 229 (2001), 101-124.   DOI 10.1016/S0012-365X(00)00204-1. © Elsevier B.V. Preprint/file.
  100. 1999:   A note on possible extensions of Negami's conjecture.  Journal of Graph Theory 32 (1999), 234-240.   DOI 10.1002/(SICI)1097-0118(199911)32:3%3C234::AID-JGT3%3E3.3.CO;2-E. © John Wiley & Sons, Inc. Preprint/file.
  101. 1998:   Classes and recognition of curve contact graphs.  J. of Combinatorial Theory ser. B 74 (1998), 87-103.   DOI 10.1006/jctb.1998.1846. © Elsevier B.V. Preprint/file.
  102. 1998:   K4,4 - e has no finite planar cover.  Journal of Graph Theory 27 (1998), 51-60.   DOI 10.1002/(SICI)1097-0118(199801)27:1%3C51::AID-JGT8%3E3.3.CO;2-S. © John Wiley & Sons, Inc. Preprint/file.
  103. 1998:   The maximal clique and colourability of curve contact graphs.  Discrete Applied Mathematics 81 (1998), 59-68.   DOI 10.1016/S0166-218X(97)00075-9. © Elsevier B.V.
  104. 1997:   Touching graphs of unit balls.  In: Graph Drawing GD '97, Lecture Notes in Computer Science 1353, Springer Verlag (1997), 350-358.   DOI 10.1007/3-540-63938-1_80. © Springer-Verlag. Preprint/file.
  105. 1997 (co-author J. Kratochvíl):   Computational complexity of the Krausz dimension of graphs.  In: Graph-Theoretic Concepts in Computer Science WG '97, Lecture Notes in Computer Science 1335, Springer Verlag (1997), 214-228.   URL: www.springerlink.com/content/m6837m342j831711/. © Springer-Verlag.
  106. 1996:   Contact graphs of curves (extended abstract).  In: Graph Drawing GD '95, Lecture Notes in Computer Science 1027, Springer Verlag (1996), 312-323.   DOI 10.1007/BFb0021814. © Springer-Verlag.
  107. 1995 (co-author A. Kuběna):   A note on intersection dimensions of graph classes.  Comment. Math. Univ. Carolinae 36 (1995), 255-261.   URL: cmuc.karlin.mff.cuni.cz/pdf/cmuc9502/hlineny.pdf.

Conference and workshop talks of Petr Hliněný

  1. 2016 ( co-authors many. . . ):    Testing FO properties of dense structures.  ACCOTA 2016, Los Cabos, Mexico. November 28-December 2, 2016.   Presentation.
  2. 2016:    Toroidal Grid Minors, Embedding Stretch, and Crossing Number.  Joint STOC/SoCG Workshop Day, Boston MA, USA. June 18, 2016.   Presentation.
  3. 2016 ( co-author M. Derňár):    Crossing Number is Hard for Kernelization.  SoCG 2016, Boston MA, USA. June 14-17, 2016.   Presentation.
  4. 2016 ( co-author M. Chimani):    Inserting Multiple Edges into a Planar Graph.  SoCG 2016, Boston MA, USA. June 14-17, 2016.   Presentation.
  5. 2015:    Constructing a path-decomposition of a represented matroid using self-reduction.  A conference in honour of Geoff Whittle, Victoria University of Wellington, New Zealand. December 14-16, 2015.   URL: sms.victoria.ac.nz/foswiki/pub/Events/GeoffWhittleConference/Programme/PH.pdf.
  6. 2015 ( co-author G. Salazar):    On Hardness of the Joint Crossing Number.  ISAAC 2015, Nagoya, Japan. December 9-11, 2015.   Presentation.
  7. 2015 ( co-author G. Salazar):    On Hardness of the Joint Crossing Number.  Crossing Number Workshop 2015, Rio de Janeiro, Brasil. May 18-22, 2015.
  8. 2014 ( co-authors J. Gajarský, J. Obdržálek, S. Ordyniak):    Faster Existential FO Model Checking on Posets.  ISAAC 2014, Jeonju, Korea. December 15-17, 2014.   Presentation.
  9. 2014:    Planar Graph Emulators - Beyond Planarity in the Plane.  2014 KAIST CMC Discrete Math Workshop, Daejeon, Korea. December 10-12, 2014.   Presentation.
  10. 2014 ( co-author O. Kwon, J. Obdržálek, S. Ordyniak):    Tree-depth and vertex minors.  Structure in Graphs and Matroids, Princeton, USA. July 21-25, 2014.   Presentation.
  11. 2014 ( co-author M. Chimani):    Approximating Multiple Edge Insertion and the Crossing Number.  Crossing Number Workshop 2014, Maribor, Slovenia. June 11-15, 2014.   Presentation.
  12. 2013 ( co-author M. Derka):    Planar Emulators Conjecture Is Nearly True for Cubic Graphs.  European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Pisa, Italy. June 9-13, 2013.   Presentation.
  13. 2013 ( co-authors R. Ganian, D. Král', J. Obdržálek, J. Schwartz, J. Teska):    FO Model Checking of Interval Graphs.  ICALP 2013, Riga, Latvia. July 8-12, 2013.   Presentation.
  14. 2013 ( co-author M. Derka):    Planar Emulators Conjecture Is Nearly True for Cubic Graphs.  CSASC 2013 - Joint Mathematical Conference, Koper, Slovenia. June 9-13, 2013.   Presentation.
  15. 2013 ( co-authors R. Ganian, D. Král', J. Obdržálek, J. Schwartz, J. Teska):    FO Properties of Interval Graphs.  CSASC 2013 - Joint Mathematical Conference, Koper, Slovenia. June 9-13, 2013.   Presentation.
  16. 2013 ( co-authors R. Ganian, J. Obdržálek):    On an odd case of an XP algorithm for graphs of bounded clique-width.  AMS-MAA Joint Mathematics Meeting, San Diego, USA. January 9-12, 2013.   Presentation.
  17. 2012 ( co-authors J. Gajarský, R. Ganian, J. Nešetřil, J. Obdržálek, P. Ossona de Mendez, R. Ramadurai):    Can dense graphs be "sparse"?.  Third Workshop on Graphs and Matroids, Maastricht, The Netherlands. July 29-August 4, 2012.   Presentation.
  18. 2012 ( co-author J. Gajarský):    Faster than Courcelle's theorem on shrubs.  Seminar 12241: Data Reduction and Problem Kernels, Schloss Dagstuhl. June 10-15, 2012.   URL: www.dagstuhl.de/12241. Presentation.
  19. 2012 ( co-author J. Gajarský):    Faster than Courcelle's theorem on shrubs.  Czech-Slovak Conference on Graph Theory 2012, Litomyšl, Czech republic. May 28-June 1, 2012.   Presentation.
  20. 2012 ( co-author J. Gajarský):    Testing Graph MSO Properties: A Fresh View.  Graph Theory @ Georgia Tech: Conference in Honor of Professor Robin Thomas, Georgia Tech, Atlanta GA, USA. May 7-11, 2012.   URL: gtatgt.gatech.edu. Presentation.
  21. 2012 ( co-authors M. Chimani, M. Derka, M. Klusáček):    How Not to Characterize Planar-emulable Graphs.  Workshop on Algebraic, Topological and Complexity Aspects of Graph Covers (ATCAGC 2012), University of Oregon, USA. January 26-31, 2012.   Presentation.
  22. 2011 ( co-authors M. Chimani, G. Salazar):    On the Crossing Number of Surface-Embedded Graphs.  Crossing Numbers Turn Useful (11w5144), Banff International Research Station, Canada. August 21-26, 2011.   URL: www.birs.ca/events/2011/5-day-workshops/11w5144. Presentation.
  23. 2011 ( co-author M. Chimani):    A Tighter Insertion-based Approximation of the Graph Crossing Number.  7th Slovenian International Conference on Graph Theory, Bled, Slovenia. June 19-25, 2011.   URL: conferences2.imfm.si/conferenceDisplay.py?confId=1. Presentation.
  24. 2011 ( co-author M. Chimani):    A Tighter Insertion-based Approximation of the Graph Crossing Number.  Graph Algorithms and Combinatorial Optimization, NII Shonan Meeting 2011, Japan. February 13-18, 2011.   URL: www.nii.ac.jp/shonan/blog/2010/08/02/graph-algorithm-and-combinatorial-optimization. Presentation.
  25. 2011 ( co-authors M. Chimani, M. Derka, M. Klusáček):    New Development in Planar Emulators.  Workshop on Graph Covers (ATCAGC 2011), Králova Studňa, Slovakia. January 23-26, 2011.   URL: www.savbb.sk/conf/atcagc11. Presentation.
  26. 2010:    Canonical Generation of Matroids.  Matroids and Computation 2010 workshop, Victoria University of Wellington, New Zealand. November 29 - December 3, 2010.   URL: msor.victoria.ac.nz/Main/MatroidComputation. Presentation.
  27. 2010 ( co-authors R. Ganian, J. Obdržálek):    On efficient solvability of graph problems parameterized by "width" (rank-width).  Workshop on Graph Decomposition: Theoretical, Algorithmic and Logical Aspects, CIRM Marseille, France. October 18-22, 2010.   URL: www.lirmm.fr/ paul/ANR/cirm-2010.html. Presentation.
  28. 2010:    Where Myhill-Nerode Theorem Meets Parameterized Algorithmics.  Parametrized Complexity of Computational Reasoning, Workshop of MFCSL 2010, Brno, Czech republic. August 28, 2010.   URL: mfcsl2010.fi.muni.cz. Presentation.
  29. 2010 ( co-authors R. Ganian, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith, S. Sikdar):    On "good" and "bad" digraph width measures.  Logic, Combinatorics and Computation, Workshop of MFCSL 2010, Brno, Czech republic. August 28-29, 2010.   URL: mfcsl2010.fi.muni.cz. Presentation.
  30. 2010 ( co-author G. Salazar):    Lower Bounds on the Crossing Number of Surface-Embedded Graphs I: Up to Torus.  Theory and Algorithmic Aspects of Graph Crossing Number, Workshop of MFCSL 2010, Brno, Czech republic. August 21-22, 2010.   URL: mfcsl2010.fi.muni.cz. Presentation.
  31. 2010 ( co-authors R. Ganian, J. Kneis, D. Meister, J. Obdržálek, P. Rossmanith, S. Sikdar):    How "Good" Digraph Width Measures Do / Can We Have?.  Second Workshop on Graphs and Matroids, CWI & Maastricht University, Maastricht, NL. August 1-7, 2010.   URL: homepages.cwi.nl/ bgerards/workshops/2010. Presentation.
  32. 2010 ( co-authors R. Ganian, J. Obdržálek):    Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width.  XIth Conference of Czech Mathematicians CSASC 2010, Prague, Czech republic. January 25, 2010.   URL: cms.jcmf.cz/csasc. Presentation.
  33. 2010 ( co-author M. Chimani):    Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface.  ACM-SIAM Symposium on Discrete Algorithms (SODA10), Austin, Texas USA. January 17-20, 2010.   URL: www.siam.org/meetings/da10. Presentation.
  34. 2009:    Planar emulators: On a surprising fall of Fellows conjecture, and beyond.  Graph Embeddings and Maps on Surfaces GEMS 09, Tále, Slovakia. June 28 - July 3, 2009.   URL: gems.savbb.sk. Presentation.
  35. 2009 ( co-author R. Ganian):    On Parse Trees and Myhill-Nerode Tools for Graphs of Bounded Rank-width.  DIMAP workshop on Algorithmic Graph Theory 2009, University of Warwick, UK. March 23-25, 2009.   URL: www2.warwick.ac.uk/fac/cross_fac/dimap/events/agt2009. Presentation.
  36. 2009:    21 Years of Negami's Planar Cover Conjecture.  Workshop on Graph Covers (ATCAGC 2009), Finse, Norway. February 19-21, 2009.   URL: www.uib.no/rg/algo/artikler/2009/02/atcagc-2009. Presentation.
  37. 2008:    Graph decompositions, Parse trees, and MSO properties.  Combinatorial and Computational Aspects of Optimization, Topology and Algebra ACCOTA 2008, Oaxaca, Mexico. December 8-12, 2008.   URL: www.math.cinvestav.mx/accota. Presentation.
  38. 2008:    20 Years of Negami's Planar Cover Conjecture.  The 20th Workshop on Topological Graph Theory in Yokohama, Japan. November 24-28, 2008.   URL: www.ngm.edhs.ynu.ac.jp/negami/tgt/tgt20/index.html. Presentation.
  39. 2008 ( co-author G. Whittle):    Some Recent Additions to Matroid Tree-Width.  Netherlands Workshop on Graphs and Matroids, Sittard, NL. July 18-23, 2008.   Presentation.
  40. 2008 ( co-author G. Whittle):    Approaching Tree-Width of Graphs from a Matroidal Perspective.  Czech-Slovak Conference on Graph Theory 2008, Zadov, Czech Republic. June 9-13, 2008.   URL: dimatia.fav.zcu.cz/dm/CSGT2008. Presentation.
  41. 2007 ( co-author G. Salazar):    Approximating the Crossing Number of Toroidal Graphs.  18th International Symposium on Algorithms and Computation ISAAC 2007, Sendai, Japan. December 17-19, 2007.   URL: www.nishizeki.ecei.tohoku.ac.jp/isaac07. Presentation.
  42. 2007 ( co-author S. Oum):    Finding branch-decomposition and rank-decomposition.  Joint Meeting of the AMS - NZMS 2007, Wellington, New Zealand. December 12-15, 2007.   URL: www.mcs.vuw.ac.nz/~mathmeet/amsnzms2007.
  43. 2007 ( co-author S. Oum):    Finding branch-decomposition and rank-decomposition.  ALGO: ESA 2007, Eilat, Israel. October 7-11, 2007.   URL: www.algo07.cs.tau.ac.il/esa.html. Presentation.
  44. 2007:    Approximating the crossing number for graphs close to planarity.  Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, Dagstuhl Seminar #07281, Germany. July 8-13, 2007.   URL: www.dagstuhl.de/en. Presentation.
  45. 2007:    New almost-planar crossing-critical graph families.  6th Slovenian International Conference on Graph Theory, Bled, Slovenia. June 24-30, 2007.   URL: conferences.imfm.si/internalPage.py?pageId=8&confId=2. Presentation.
  46. 2007 ( co-authors I. Gitler, J. Lea~nos, G. Salazar):    The crossing number of a projective graph is quadratic in the face-width.  Czech-Slovak Conference on Graph Theory 2007, Hradec nad Moravicí, Czech republic. June 11-15, 2007.   URL: graphs.vsb.cz/grafy2007. Presentation.
  47. 2006 ( co-author D. Seese):    On decidability of MSO theories of combinatorial structures: Towards general matroids?.  Logic and Combinatorics, Workshop at CSL'06. September 23-24, 2006.   URL: www.labri.fr/perso/courcell/WkShopSzeged.html. Presentation.
  48. 2006 ( co-author G. Salazar):    On the Crossing Number of Almost Planar Graphs.  Graph Drawing GD 2006, Karlsruhe, Germany. September 18-20, 2006.   URL: gd2006.org. Presentation.
  49. 2006:    On Matroid Representability and Minor Problems.  Symposium on Math Foundations of Computer Science MFCS 2006, Stará Lesná, Slovakia. August 28 - September 2, 2006.   URL: www.mfcs.sk/mfcs2006. Presentation.
  50. 2006 ( co-author J. Obdržálek):    Escape-width: measuring "width" of digraphs.  Fifth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications 2006, Prague, Czech Republic. July 7-15, 2006.   URL: kam.mff.cuni.cz/~cs06. Presentation.
  51. 2006:    MACEK - Real Structural Computations with Representable Matroids.  AXIOM workshop, RISC Institute, Linz, Austria. April 27-29, 2006.   URL: wiki.axiom-developer.org/WorkshopRisc2006. Presentation.
  52. 2006 ( co-authors D. Hliněná, P. Vojtáš):    A note on multicriteria decision making.  Fuzzy Sets FSTA 2006, Liptovský Ján, Slovak Republic. January 30 - February 3, 2006.   URL: www.valm.sk/fsta. Presentation.
  53. 2005:    On Crossing-Critical Graphs.  Workshop on Geometric Graphs, Asian Applied Computing Conference AACC2005, Kathmandu, Nepal. December 11, 2005.
  54. 2005:    Combinatorial Generation of Matroid Representations: Theory and Practice.  Asian Applied Computing Conference AACC2005, Kathmandu, Nepal. December 10-12, 2005.   URL: www.aacc.org.np.
  55. 2005 ( co-author G. Whittle):    Matroid Tree-Width and Chordality.  Workshop on Graph Classes and Width Parameters, Charles University, Prague, Czech Republic. October 17-19, 2005.   URL: kam.mff.cuni.cz/conferences/Wlab05. Presentation.
  56. 2005 ( co-authors M. Noy, O. Gimenez):    Computing the Tutte Polynomial with Restricted "Width".  2nd Workshop on Tutte Polynomials and Applications, CRM, UAB Bellaterra, Spain. October 4-7, 2005.   URL: www.crm.es. Presentation.
  57. 2005:    Width Parameters of Matroids.  Exact Algorithms and Fixed-Parameter Tractability, Dagstuhl Seminar #05301, Germany. July 23-29, 2005.   URL: www.dagstuhl.de. Presentation.
  58. 2005:    On crossing-critical graphs.  Graph Embeddings and Maps on Surfaces GEMS 2005, Stará Lesná, Slovakia. June 26 - July 1, 2005.   URL: umv.science.upjs.sk/gems2005. Presentation.
  59. 2005 ( co-authors M. Noy, O. Gimenez):    Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.  Graph-Theoretical Concepts in Computer Science WG '05, Metz, France. June 23-25, 2005.   URL: www.lita.univ-metz.fr/ ~wg2005. Presentation.
  60. 2005 ( co-authors M. Noy, O. Gimenez):    Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.  The First Czech-Catalan Conference in Mathematics, Prague, Czech Republic. May 27-28, 2005.
  61. 2005:    O matroidech v teoretické informatice.  Současné Trendy Teoretické Informatiky, Institute for Theoretical Computer Science. May 13-14, 2005.
  62. 2004:    Matroid decompositions.  Workshop on Graph and Hypergraph Decompositions, Wolfgang Pauli Institute Vienna, Austria. December 16-18, 2004.   URL: www.mat.univie.ac.at/ ~wpi. Presentation.
  63. 2004:    Crossing Number is Hard for Cubic Graphs.  Combinatorial and Computational Aspects of Optimization, Topology and Algebra (ACCOTA 2004), San Miguel, Mexico. November 1-6, 2004.   URL: accota.math.cinvestav.mx/2004_index.html. Presentation.
  64. 2004:    Are Matroids Interesting Combinatorial Structures?.  Workshop on Logic and Graph Transformations, ICGT 2004, Roma, Italy. October 1-2, 2004.   URL: www.labri.fr/Perso/~courcell/LogicIcgt.html. Presentation.
  65. 2004 ( co-author D. Seese):    On Decidability of MSO Theories of Representable Matroids.  IWPEC, part of the Symposium ALGO 2004, Bergen, Norway. September 13 - 17, 2004.   URL: www.ii.uib.no/algo2004/iwpec2004. Presentation.
  66. 2004:    On the Complexity of Matroid Minors.  EMS Mathematical Weekend 04, Prague, Czech Republic. 3 - September 5, 2004.   Presentation.
  67. 2004:    Crossing Number is Hard for Cubic Graphs.  Symposium on Math Foundations of Computer Science MFCS 2004, Prague, Czech Republic. August 23-27, 2004.   URL: mfcs.mff.cuni.cz. Presentation.
  68. 2003 ( co-author G. Whittle):    Matroid Tree-Width.  Advances in Graph and Matroid Theory, a conference in honour of Neil Robertson's 65th birthday, Columbus USA. December 13-16, 2003.   URL: www.math.ohio-state.edu/~maharry/Neil65.
  69. 2003 ( co-author G. Whittle):    Tree-Width and Matroids.  Eurocomb '03 - European conference on Combinatorics, Graph Theory and Applications, Praha, Czech republic. September 8-12, 2003.   URL: kam.mff.cuni.cz/conferences/Ecomb03.
  70. 2003:    On Matroid Properties Definable in the MSO Logic.  Symposium on Math Foundations of Computer Science MFCS 2003, Bratislava, Slovakia. August 25-29, 2003.   URL: www.mfcs.sk/mfcs2003.
  71. 2003:    Algorithms on Matroids of Bounded Branch-width.  Fixed Parameter Algorithms, Dagstuhl Seminar #03311, Germany. July 27 - August 1, 2003.   URL: www.dagstuhl.de.
  72. 2003:    Branch-width, tree-width, and computational complexity in matroids.  Současné Trendy Teoretické Informatiky, Institute for Theoretical Computer Science. May 22-23, 2003.   URL: kam.mff.cuni.cz/conferences/STTI03.
  73. 2003:    Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids.  Symposium on Theoretical Aspects of Computer Science STACS 2003, Berlin, Germany. February 27 - March 1, 2003.
  74. 2002:    Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids over Finite Fields.  Conference on Matroid Structure Theory, Ohio State University, Columbus Ohio, USA. July 1-5, 2002.
  75. 2002:    The Tutte Polynomial for Matroids of Bounded Branch-Width.  Czech-Slovak Conference on Graph Theory 2002, Rejvíz, Czech republic. May 27-31, 2002.
  76. 2001:    Crossing-Critical Graphs and Path-width.  Graph Drawing GD 2001, Vienna, Austria. September 23-26, 2001.
  77. 2001 ( co-authors J.F. Geelen, G. Whittle):    Matroid Connectivity and Bridging Separations.  The 26th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, Curtin University, Perth, Australia. July 9-13, 2001.
  78. 2000:    Crossing-Number Critical Graphs have Bounded Pathwidth.  Algebraic and Topological Methods In Graph Theory (ATMGT 2000), University of Auckland, New Zealand. December 11-15, 2000.
  79. 2000 ( co-authors L.A. Goddyn, W. Hochstaettler):    Flows in Matroids.  The 25th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, University of Canterbury, New Zealand. December 4-8, 2000.
  80. 2000:    An Addition to Art Galleries with Interior Walls.  Workshop on Colourings and Homomorphisms, PIMS Simon Fraser University, Vancouver, Canada. July 17-28, 2000.
  81. 2000:    Crossing-Number Critical Graphs have Bounded Pathwidth.  Workshop on Flows, Cycles and Orientations, PIMS Simon Fraser University, Vancouver Canada. July 3-14, 2000.
  82. 2000:    Negami's conjecture - What next?.  Workshop on Graph Minors and Topological Graph Theory, The Fields Institute, Toronto, Canada. January 17-22, 2000.
  83. 1999 ( co-author R. Thomas):    On possible counterexamples to Negami's planar cover conjecture.  Fourth Slovenian Conference on Graph Theory, Bled, Slovenia. June 28 - July 2, 1999.
  84. 1999 ( co-author R. Thomas):    On possible counterexamples to Negami's planar cover conjecture.  Twelfth Cumberland Conference on Combinatorics, Graph Theory and Computing, Louisville, Kentucky USA. May 20-22, 1999.
  85. 1999 ( co-author R. Thomas):    On possible counterexamples to Negami's planar cover conjecture.  30th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, USA. March 8-12, 1999.
  86. 1998:    Finite planar covers of graphs.  Minisymposium on Discharging methods, 9th SIAM Conference on Discrete Mathematics, Toronto, Canada. July 12-15, 1998.
  87. 1998:    K4,4 - e has no finite planar cover.  DIMACS Research and Educational Institute '98, Rutgers University, New Jersey USA. July 27 - August 7, 1998.
  88. 1998:    Planar covers and projective planar graphs - Negami's conjecture.  Fifth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, Czech republic. July 6-11, 1998.
  89. 1998:    K4,4 - e has no finite planar cover.  29th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, Florida, USA. March 9-13, 1998.
  90. 1997:    Touching graphs of unit balls.  Conference Graph Drawing '97, Roma, Italy. September 18-20, 1997.
  91. 1997:    Planar covers and projective planar graphs.  Graph Embeddings and Maps on Surfaces GEMS'97, Banská Bystrica, Slovakia. June 29 - July 4, 1997.
  92. 1997 ( co-author J. Kratochvíl):    Computational complexity of the Krausz dimension of graphs.  Graph-Theoretic Concepts in Computer Science WG '97, Berlin, Germany. June 18-20, 1997.
  93. 1997 ( co-author J. Kratochvíl):    The Krausz dimension of graphs.  Czech-Slovak Conference on Graph Theory 1997, Chudenice, Czech republic. June 9-13, 1997.
  94. 1996:    Planar covering graphs.  International Colloquium on Combinatorics and Graph Theory, Balatonlelle, Hungary. July 15-20, 1996.
  95. 1996:    Contact graphs of curves and line segments.  Czech-Slovak Conference on Graph Theory 1996, Soláň, Czech republic. June 17-21, 1996.
  96. 1995:    Contact graphs of curves.  Graph Drawing '95, Passau, Germany. September 20-22, 1995.