Filter
Conference contribution

Search results

  • 2019

    Directed Intersection Representations and the Information Content of Digraphs

    Kostochka, A. V., Liu, X., Machado, R. & Milenkovic, O., Jul 2019, 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 1477-1481 5 p. 8849253. (IEEE International Symposium on Information Theory - Proceedings; vol. 2019-July).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • 2013

    On coloring of sparse graphs

    Kostochka, A. & Yancey, M., 2013, Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013. Springer, p. 224-234 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7913 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2010

    Coloring uniform hypergraphs with small edge degrees

    Kostochka, A. V., Kumbhat, M. & Rödl, V., 2010, Fete of Combinatorics and Computer Science. p. 213-238 26 p. (Bolyai Society Mathematical Studies; vol. 20).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • 2004

    Coloring intersection graphs of geometric figures with a given clique number

    Kostochka, A., 2004, Towards a theory of geometric graphs. American Mathematical Society, Vol. 342. p. 127-138 12 p. (Contemp. Math.).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1999

    Every outerplanar graph is the union of two interval graphs

    Kostochka, A. V. & West, D. B., 1999, Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999). Vol. 139. p. 5-8 4 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • On the minimum number of edges giving maximum oriented chromatic number

    Kostochka, A. V., L uczak, T., Simonyi, G. & Sopena, E., 1999, Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. Graham, R. L., Kratochvil, J., Nešetřil, J. & Roberts, F. S. (eds.). American Mathematical Society, p. 179-182 4 p. (DIMACS Series in Discrete Mathematics and Theoretical Computer Science; vol. 49).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 1995

    A characterization of seymour graphs

    Ageev, A. A., Kostochka, A. V. & Szigeti, Z., 1995, Integer Programming and Combinatorial Optimization - 4th International IPCO Conference, 1995, Proceedings. Balas, E. & Clausen, J. (eds.). Springer, p. 364-372 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 920).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution