Bernard Lidický - UIUC - KAM

Papers submitted to journals

1. J. Balogh, P. Hu, B. Lidický, F. Pfender, J. Volec, M. Young:
   Rainbow triangles in three-colored graphs submitted
   
   
2. J. Balogh, M. Delcourt, B. Lidický, C. Palmer:
   Rainbow copies of C₄ in edge-colored hypercubes, submitted
   
   
3. H.A. Kierstead, B. Lidický:
   On choosability with separation of planar graphs with lists of different sizes submitted arXiv
   
   
4. Z. Dvořák, B. Lidický:
   3-coloring triangle-free planar graphs with a precolored 8-cycle, submitted arXiv slides
   
   
5. I. Choi, B. Lidický, D. Stolee:
   On Choosability with Separation of Planar Graphs with Forbidden Cycles, submitted arXiv
   
   
6. Z. Dvořák, B. Lidický, B. Mohar, L. Postle:
   5-list-coloring planar graphs with distant precolored vertices, submitted. arXiv
   
   
7. Z. Dvořák, B. Lidický, B. Mohar:
   5-choosability of graphs with crossings far apart, submitted. arXiv slides
   
   

Papers in refereed journals

1. J. Balogh, P. Hu, B. Lidický, O. Pikhurko, B. Udvari, J. Volec:
   Minimum number of monotone subsequences of length 4 in permutations, accepted to Combinatorics, Probability and Computing slides
   
   
2. O.V. Borodin, Z. Dvořák, A.V. Kostochka, B. Lidický, M. Yancey:
   Planar 4-critical graphs with four triangles, European J. of Combinatorics 41 (2014), 138-151 doi arXiv slides
   
   
3. Z. Dvořák, B. Lidický:
   4-critical graphs on surfaces without contractible (≤4)-cycles,
   SIAM J. Discrete Math. 28(1) (2014), 521–552 dio arXiv slides
   
   
4. O.V. Borodin, A.V. Kostochka, B. Lidický, M. Yancey:
   Short proofs of coloring theorems on planar graphs, European J. of Combinatorics 36 (2014), 314–321 doi arXiv slides
   
   
5. J. Balogh, P. Hu, B. Lidický, H. Liu:
   Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube, European Journal of Combinatorics, 35 (2014), 75–85 doi arXiv slides
   
   
6. B. Lidický, H. Liu, C. Palmer:
   On the Turán number of forests, Electronic Journal of Combinatorics, 20-2 (2013) P62 arXiv
   
   
7. S. Har-Peled, B. Lidický:
   Peeling the Grid, SIAM J. Discrete Math. 27-2 (2013), 650-655 doi arXiv
   
   
8. V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidický, M. Tesař, T. Vyskočil:
   The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree, Graphs and Combinatorics 29-4 (2013), 981-1005. doi arXiv
   Also at: Graph Drawing 2009, LNCS 5849 (2010), 304-314. doi PDF slides
   
   
9. P. Golovach, B. Lidický, B. Martin, D. Paulusma:
   Finding vertex-surjective graph homomorphisms, Acta Informatica 49 (2012) 381-394. arXiv dio
   Also at: CSR 2012, Lecture Notes in Computer Science 7353 (2012), 160-171. doi PDF
   
   
10. Z. Dvořák, B. Lidický, R. Škrekovski:
    Bipartizing fullerenes, European J. of Combinatorics 33 (2012), 1286–1293. arXiv dio slides
    
    
11. J. Fiala, P. Golovach, J. Kratochvíl, B. Lidický, D. Paulusma:
    Distance Three Labelings of Trees, Discrete Applied Math. 160 (2012), 764-779. preprint doi
    Also includes: P. Golovach, B. Lidický, D. Paulusma:
    L(2,1,1)-labeling is NP-complete for trees, LNCS 6108 (2010), 211-221. TAMC 2010 doi slides
    
    
12. J. Ekstein, P. Holub, B. Lidický:
    Packing Chromatic Number of Distance Graphs, Discrete Applied Math. 160 (2012), 518-524. arXiv sources doi
    
    
13. J. Fiala, M. Kaminski, B. Lidický, D. Paulusma:
    The k-in-a-path problem for claw-free graphs, Algorithmica 62 (2012), 499-519. dio
    Also in: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science,
    LIPIcs 5 (2010), 371-382. STACS 2010 arXiv doi slides
    
    
14. Z. Dvořák, B. Lidický, R. Škrekovski:
    Graphs with two crossings are 5-choosable, SIAM J. on Discrete Math. 25 (2011), 1746-1753. arXiv doi
    
    
15. R. Erman, F. Havet, B. Lidický, O. Pangrác:
    5-colouring graphs with 4 crossings, SIAM J. on Discrete Math. 25 (2011), 401-422. preprint doi slides
    
    
16. Z. Dvořák, B. Lidický, R. Škrekovski:
    Randic index and the diameter of a graph, European Journal of Combinatorics 32 (2011), 434-442. preprint doi
    
    
17. Z. Dvořák, B. Lidický, R. Škrekovski:
    3-choosability of triangle-free planar graphs with constraint on 4-cycles, SIAM J. on Discrete Math. 24 (2010), 934-945. preprint doi slides
    
    
18. T. Kaiser, D. Král', B. Lidický, P. Nejedlý, R. Šámal:
    Short cycle covers of graphs with minimum degree three, SIAM J. Discrete Math. 24 (2010), 330-355 arXiv doi slides
    
    
19. Z. Dvořák, B. Lidický, R. Škrekovski:
    On 3-choosability of plane graphs without 3-,7- and 8- cycles, Discrete Math. 309 (2009), 5899-5904 preprint doi slides
    
    
20. K. Kawarabayashi, D. Král, J. Kynčl, B. Lidický:
    6-critical graphs on the Klein bottle, SIAM J. on Discrete Math. 23 (2009), 372-383, preprint, sources doi
    
    
21. B. Lidický:
    On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles, Australasian Journal of Combinatorics 44 (2009), 77-86, preprint slides
    
    
22. J. Fiala, S. Klavžar, B. Lidický:
    The packing chromatic number of infinite product graphs, European Journal of Combinatorics 30 (2009), 1101-1113 preprint doi slides

Papers in (or submitted to) refereed conference proceedings only (no journal version)

1. F. Cicalese, B. Keszegh, B. Lidicky, D. Palvolgyi, T. Valla
   On the Tree Search Problem with Non-uniform Costs submitted arXiv slides
   
   
2. D. Nikovski, B. Lidický, W. Zhang, K. Kataoka, K. Yoshimoto:
   Markov decision processes for train run curve optimization IEEE ESARS 2012 (Electircal System for Aircraft, Railway and Ship Propulsion) doi
   
   
3. O. Bílka, B. Lidický, M. Tesař:
   Locally injective homomorphism to the simple Weight graphs LNCS 6648 (2011), 471-482. TAMC 2011 doi slides
   
   
4. B. Lidický, M. Tesař:
   Complexity of locally injective homomorphism to the Theta graphs, LNCS 6460 (2011), 326-336. IWOCA 2010 doi
   
   
5. A. Maitos, F. Jordán, B. Lidický, K. Kabele, P. Strachan
   Coupling building simulation with a hardware real-time controller Simulace budov a techniky prostředí 2010, CVUT (2010), 115-120.
   
   
6. V. Jelínek, E. Jelínková, J. Kratochvíl, B. Lidický:
   Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters, LNCS 5417 (2009), 121-132. Graph Drawing 2008 doi

Papers in conference proceedings

1. N. Chenette, L. Postle, N. Streib, R. Thomas, C. Yerger, K. Kawarabayashi, D. Král', J. Kynčl, B. Lidický:
   Six-Critical Graphs on the Klein Bottle, Electronic Notes in Discrete Mathematics 31 (2008), 235-240. Topological and Geometric Graph Theory 2008 doi

Other manuscripts

1. F. Havet, B. Lidický:
   Splitting a tournament into two subtournaments with given minimum outdegree (2014) Some overlap with other paper
2. B. Lidický:
   Theis (2011)
3. J. Ekstein, J. Fiala, P. Holub, B. Lidický:
   The packing chromatic number of the square lattice is at least 12 arXiv sources (2010)
4. P. Kolman, B. Lidický, J.-S. Sereni:
   On Minimum Fair Odd Cycle Transversal KAM-DIMATIA Series 956 (2010)
5. J. Kynčl, B. Lidický, T. Vyskočil:
   Irreversible 2-conversion set is NP-complete KAM-DIMATIA Series 933 (2009)

Slides (including all the mistkes)

• 17.5.2014 Cumberland - On the Tree Search Problem with Non-uniform costs
• 25.1.2014 Atlanta Lecture Series - Number of monotone subsequences of length four in permutations
• 6.10.2013 AMS - Extending 3-coloring of a face in triangle-free planar graphs
• 9.7.2013 CSTGA - 3-coloring planar graphs with four triangles
• 14.4.2013 AMS - Short proofs of coloring theorems on planar graphs
• 14.4.2013 MIGHTY LIV - 3-coloring planar graphs with four triangles
• 2.3.2013 AMS - Short proofs of coloring theorems on planar graphs
• 22.9.2012 MIGHTY LIII - 4-critical graphs on surfaces without contractible cycles of length at most 4
• 19.5.2012 SIAM - L(2, 1, 1)-kabeling is NP-Complete for trees
• 18.5.2012 SIAM - 4-critical graphs on surfaces without contractible cycles of length at most 4
• 12.5.2012 Cumberland - The planar slope-number of planar partial 3-trees of bounded degree
• 18.3.2012 AMS - Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• 27.1.2012 Postdoctoral Research Symposium - Bipartizing fulerenes
• 23.6.2011 Bled - Packing Coloring and Grids
• 31.5.2011 CanaDAM - List coloring and crossings
• 6.9.2010 Cycles and Colourings - Packing chromatic number for square and hexagonal lattice
• 17.6.2010 SIAM - 5-Coloring Graphs with 4 Crossings
• 16.2.2010 ATCAGC - Computational Complexity of Locally Injective Homomorphisms to Weight Graphs: A Full Classification of Simple Weights
• 22.1.2010 CSASC - The k-in-a-path problem for claw-free graphs
• 27.5.2009 CanaDAM - On 3-chosability of triangle free planar graphs
• 12.9.2008 Cycles and Colourings - Short cycle covers of graphs with minimum degree three
• 3.9.2009 Cycles and Colourings - Packing chromatic number for lattices
• 5.3.2007 Winter School on Combinatorcis - Discharging and list coloring