Skip to content

Dr Janka Chlebikova

Senior Lecturer

  1. 2019
  2. Published

    Proportionally dense subgraph of maximum size: complexity and approximation

    Bazgan, C., Dr Janka Chlebikova, Clément Dallard & Pontoizeau, T., 1 Nov 2019, In : Discrete Applied Mathematics. 270, p. 25-36 12 p.

    Research output: Contribution to journalArticle

  3. Early online

    Graphs without a partition into two proportionally dense subgraphs

    Bazgan, C., Dr Janka Chlebikova & Clément Dallard, 31 Oct 2019, In : Information Processing Letters.

    Research output: Contribution to journalArticle

  4. Published

    Approximation hardness of Travelling Salesman via weighted amplifiers

    Chlebik, M. & Dr Janka Chlebikova, Aug 2019, Computing and Combinatorics - 25th International Conference, COCOON 2019, Xian, China, July 29 -31, 2019, Proceedings. Du, D-Z., Duan, Z. & Tian, C. (eds.). Springer, p. 115-127 12 p. (Lecture Notes in Computer Science; vol. 11653).

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

  5. Published

    Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs

    Dr Janka Chlebikova & Clément Dallard, 10 Jul 2019, Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings. Colbourn, C., Grossi, R. & Pisanti, N. (eds.). Springer, p. 136-147 12 p. (Lecture Notes in Computer Science; vol. 11638).

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

  6. Published

    Complexity of scheduling for DARP with soft ride times

    Dr Janka Chlebikova, Clément Dallard & Paulsen, N., 1 May 2019, Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings. Heggernes, P. (ed.). Springer, p. 149-160 12 p. (Lecture Notes in Computer Science; vol. 11485).

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

  7. 2018
  8. Published

    Structural and algorithmic properties of 2-community structures

    Dr Janka Chlebikova, Bazgan, C. & Pontoizeau, T., 1 Jun 2018, In : Algorithmica. 80, 6, p. 1890-1908 19 p.

    Research output: Contribution to journalArticle

  9. 2017
  10. Published

    The firefighter problem: further steps in understanding its complexity

    Dr Janka Chlebikova & Chopin, M., 9 May 2017, In : Theoretical Computer Science. 676, p. 42-51 10 p.

    Research output: Contribution to journalArticle

  11. 2015
  12. Published

    New insight into 2-community structures in graphs with applications in social networks

    Bazgan, C., Dr Janka Chlebikova & Pontoizeau, T., 9 Dec 2015, Combinatorial Optimization and Applications: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. Lu, Z., Kim, D., Wu, W., Li, W. & Du, D-Z. (eds.). Springer, p. 236-250 15 p. (Lecture Notes in Computer Science; vol. 9486).

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

  13. 2014
  14. Published

    The firefighter problem: a structural analysis

    Dr Janka Chlebikova & Chopin, M., 3 Dec 2014, Parameterized and Exact Computation: 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Cygan, M. & Heggernes, P. (eds.). Springer, p. 172-183 12 p. (Lecture Notes in Computer Science; vol. 8894).

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

  15. Published

    Connection between conjunctive capacity and structural properties of graphs

    Chlebik, M. & Dr Janka Chlebikova, 16 Oct 2014, In : Theoretical Computer Science. 554, p. 109-118

    Research output: Contribution to journalArticle

  16. 2013
  17. Published

    On the conjunctive capacity of graphs

    Chlebik, M. & Dr Janka Chlebikova, 2013, Computing and combinatorics: 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013, proceedings. Du, D-Z. & Zhang, G. (eds.). 7936 ed. Berlin: Springer, Vol. 7936. p. 280-291 12 p. (Lecture notes in computer science; no. 7936).

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

  18. 2009
  19. Published

    Hardness of approximation for orthogonal rectangle packing and covering problems

    Dr Janka Chlebikova & Chlebik, M., Sep 2009, In : Journal of Discrete Algorithms. 7, 3, p. 291-305 15 p.

    Research output: Contribution to journalArticle

  20. 2008
  21. Published

    Approximation hardness of dominating set problems in bounded degree graphs

    Dr Janka Chlebikova & Chlebik, M., Nov 2008, In : Information and Computation. 206, 11, p. 1264-1275 12 p.

    Research output: Contribution to journalArticle

  22. Published

    The Steiner tree problem on graphs: inapproximability results

    Dr Janka Chlebikova & Chlebik, M., 31 Oct 2008, In : Theoretical Computer Science. 406, 3, p. 207-214 8 p.

    Research output: Contribution to journalArticle

  23. Published

    Crown reductions for the Minimum Weighted Vertex Cover problem

    Dr Janka Chlebikova & Chlebik, M., Feb 2008, In : Discrete Applied Mathematics. 156, 3, p. 292-312 21 p.

    Research output: Contribution to journalArticle

  24. 2007
  25. Published

    The d-precoloring problem for k-degenerate graphs

    Dr Janka Chlebikova & Jansen, K., 28 Jul 2007, In : Discrete Mathematics. 307, 16, p. 2042-2052

    Research output: Contribution to journalArticle

  26. Published

    Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover

    Dr Janka Chlebikova & Chlebik, M., 15 Jan 2007, In : Discrete Applied Mathematics. 155, 2, p. 172-179

    Research output: Contribution to journalArticle

  27. Published

    A characterization of some graph classes using excluded minors

    Dr Janka Chlebikova, 2007, In : Periodica Mathematica Hungarica. 55, 1, p. 1-9

    Research output: Contribution to journalArticle

  28. Published

    The complexity of combinatorial optimization problems on d‐dimensional boxes

    Chlebik, M. & Dr Janka Chlebikova, 2007, In : Siam Journal on Discrete Mathematics. 21, 1, p. 158-169 12 p.

    Research output: Contribution to journalArticle

  29. 2006
  30. Published

    Approximation hardness of edge dominating set problems

    Chlebik, M. & Dr Janka Chlebikova, May 2006, In : Journal of Combinatorial Optimisation. 11, 3, p. 279--290

    Research output: Contribution to journalArticle

Previous 1 2 Next

ID: 16199