LSE creators

Number of items: 38.
Mathematics
  • Eickmeyer, Kord, Heuvel, Jan van den, Kawarabayashi, Ken-Ichi, Kreutzer, Stephan, Mendez, Patrice Ossona De, Pilipczuk, Micha, Quiroz, Daniel A., Rabinovich, Roman, Siebertz, Sebastian (2020). Model-checking on ordered structures. ACM Transactions on Computational Logic, 21(2). https://doi.org/10.1145/3360011
  • van den Heuvel, Jan, Kierstead, H. A, Quiroz, Daniel (2019). Chromatic numbers of exact distance graphs. Journal of Combinatorial Theory, Series B, 134, 143-163. https://doi.org/10.1016/j.jctb.2018.05.007
  • van den Heuvel, Jan, Wood, David R. (2018). Improper colourings inspired by Hadwiger’s conjecture. Journal of the London Mathematical Society, 98(1), 129 - 148. https://doi.org/10.1112/jlms.12127
  • Edwards, Katherine, Girão, António, van den Heuvel, Jan, Kang, Ross J., Puleo, Gregory J., Sereni, Jean-Sébastien (2018). Extension from precoloured sets of edges. Electronic Journal of Combinatorics, 25(3), P3.1.
  • van den Heuvel, Jan, Ossona de Mendez, Patrice, Quiroz, Daniel, Rabinovich, Roman, Siebertz, Sebastian (2017). On the generalised colouring numbers of graphs that exclude a fixed minor. European Journal of Combinatorics, 66, 129-144. https://doi.org/10.1016/j.ejc.2017.06.019
  • van den Heuvel, Jan, Kreutzer, Stephan, Pilipczuk, Michal, Quiroz, Daniel, Rabinovich, Roman, Siebertz, Sebastian (2017-06-20 - 2017-06-23) Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion [Paper]. 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, ISL. https://doi.org/10.1109/LICS.2017.8005115
  • van den Heuvel, Jan, Král', Daniel, Kupec, Martin, Sereni, Jean-Sébastien, Volec, Jan (2014). Extensions of fractional precolorings show discontinuous behavior. Journal of Graph Theory, 77(4), 299-329. https://doi.org/10.1002/jgt.21787
  • Bauer, D., Broersma, H. J., van den Heuvel, Jan, Kahl, N., Nevo, A., Schmeichel, E., Woodall, D. R., Yatauro, M. (2014). Best monotone degree conditions for graph properties: a survey. Graphs and Combinatorics, 31(1). https://doi.org/10.1007/s00373-014-1465-6
  • Esperet, Louis, van den Heuvel, Jan, Maffray, Frederic, Sipma, Felix (2013). Fire containment in planar graphs. Journal of Graph Theory, 73(3), 267-279. https://doi.org/10.1002/jgt.21673
  • Amini, Omid, Esperet, Louis, van den Heuvel, Jan (2013). A unified approach to distance-two colouring of graphs on surfaces. Combinatorica, 33(3), 253-296. https://doi.org/10.1007/s00493-013-2573-2
  • Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N., Schmeichel, E. (2013). Toughness and vertex degrees. Journal of Graph Theory, 72(2), 209-219. https://doi.org/10.1002/jgt.21639
  • van den Heuvel, Jan, Thomassé, Stéphane (2012). Cyclic orderings and cyclic arboricity of matroids. Journal of Combinatorial Theory, Series B, 102(3), 638-646. https://doi.org/10.1016/j.jctb.2011.08.004
  • Bauer, D., Broersma, H. J., van den Heuvel, Jan, Kahl, N., Schmeichel, E. (2012). Degree sequences and the existence of k-Factors. Graphs and Combinatorics, 28(2), 149-166. https://doi.org/10.1007/s00373-011-1044-z
  • Cereceda, Luis, van den Heuvel, Jan, Johnson, Matthew (2011). Finding paths between 3-colorings. Journal of Graph Theory, 67(1), 69-82. https://doi.org/10.1002/jgt.20514
  • van den Heuvel, Jan, Thomassé, Stéphane (2009). Cyclic orderings and cyclic arboricity of matroids. arXiv.
  • Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N., Schmeichel, E. (2009). Degree sequences and the existence of k-factors. arXiv.
  • Cereceda, Luis, van den Heuvel, Jan, Johnson, Matthew (2009). Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics, 30(7), 1593-1606. https://doi.org/10.1016/j.ejc.2009.03.011
  • Gupta, Arvind, van den Heuvel, Jan, Manuch, Jan, Stacho, Ladislav, Zhao, Xiaohong (2008). On the complexity of ordered colorings. SIAM Journal on Discrete Mathematics, 22(2), 832-847. https://doi.org/10.1137/060676222
  • Cereceda, Luis, van den Heuvel, Jan, Johnson, Matthew (2008). Connectedness of the graph of vertex-colourings. Discrete Mathematics, 308(5-6), 913-919. https://doi.org/10.1016/j.disc.2007.07.028
  • van den Heuvel, Jan, Johnson, Matthew (2008). Transversals of subtree hypergraphs and the source location problem in digraphs. Networks, 51(2), 113-119. https://doi.org/10.1002/net.20206
  • van den Heuvel, Jan, Havet, F, McDiarmid, C, Reed, B (2007). List colouring squares of planar graphs (extended abstract). Electronic Notes in Discrete Mathematics, 29, 515-519. https://doi.org/10.1016/j.endm.2007.07.079
  • Cereceda, L, van den Heuvel, Jan, Johnson, M (2007). Finding paths between 3-colourings. London School of Economics and Political Science.
  • Amini, O, Esperet, L, van den Heuvel, J (2007). Frugal colouring of graphs. London School of Economics and Political Science.
  • Cereceda, L, van den Heuvel, Jan, Johnson, M (2007). Mixing 3-colourings in bipartite graphs. London School of Economics and Political Science.
  • Cereceda, L, van den Heuvel, J, Johnson, M (2007). Mixing 3-colourings in bipartite graphs (extended abstract). In Brandstädt, Andreas, Kratsch, Dieter, Müller, Haiko (Eds.), Graph-Theoretic Concepts in Computer Science : 33rd International Workshop (pp. 166-177). Springer Berlin / Heidelberg.
  • Gupta, Arvind, van den Heuvel, Jan, Manuch, Jan, Stacho, Ladislav, Zhao, Xiaohong (2006). On the complexity of ordered colorings. (CDAM research report series LSE-CDAM-2006-16). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • van den Heuvel, Jan, Brightwell, Graham, Stougie, Leen (2006). A linear bound on the diameter of the transportation polytope. Combinatorica, 26(2), 133-139. https://doi.org/10.1007/s00493-006-0010-5
  • Cereceda, Luis, van den Heuvel, Jan, Johnson, Matthew (2005). Connectedness of the graph of vortex-colourings. (CDAM research report series CDAM-LSE-2005-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • van den Heuvel, Jan, Johnson, Matthew (2005). The external network problem with edge- or arc-connectivity requirements. In Lopez-Ortiz, Alejandro, Hamel, Angele (Eds.), Combinatorial and Algorithmic Aspects of Networking (pp. 114-126). Springer Berlin / Heidelberg.
  • van den Heuvel, Jan, Johnson, Matthew (2004). The external network problem. (CDAM research report series LSE-CDAM-2004-15). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • van den Heuvel, Jan, Johnson, Matthew (2004). Transversals of subtree hypergraphs and the source location problem in digraphs. (CDAM research report series CDAM-2004-10). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Borodin, O. V., Broersma, H. J., Glebov, A., van den Heuvel, Jan (2004). A new upper bound on the cyclic chromatic number. (CDAM research report series LSE-CDAM-2004-04). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • van den Heuvel, Jan, McGuinness, Sean (2003). Coloring the square of a planar graph. Journal of Graph Theory, 42(2), 110-124. https://doi.org/10.1002/jgt.10077
  • van den Heuvel, Jan (2002). Radio channel assignment on 2-dimensional lattices. Annals of Combinatorics, 6(3-4), 463-477.
  • van den Heuvel, Jan, McDiarmid, Colin (2002). Channel assignment on infinite sets under frequency-distance constraints. In Leese, Robert, Hurley, Stephen (Eds.), Methods and Algorithms for Radio Channel Assignment (pp. 63-87). Oxford University Press.
  • Bondy, J. Adrian, Broersma, Hajo J., van den Heuvel, Jan, Veldman, Henk Jan (2002). Heavy cycles in weighted graphs. Discussiones Mathematicae Graph Theory, 22(1), 7-16.
  • van den Heuvel, Jan (2001). Algorithmic aspects of a chip-firing game. Combinatorics, Probability and Computing, 10(6), 505-529. https://doi.org/10.1017/S0963548301004886
  • van den Heuvel, Jan, Pejić, Snežana (2001). Using laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems. Annals of Operations Research, 107(1-4), 349-368. https://doi.org/10.1023/A:1014927805247