View graph of relations
  1. 2018
  2. Published
  3. Published
  4. Published
  5. Published
  6. Published
  7. Published
  8. Published
  9. Published
  10. 2017
  11. Published
  12. Published
  13. Published
  14. Published
    Alman, J., Mnich, M., & Vassilevska Williams, V. (2017). Dynamic parameterized problems and algorithms. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Vol. 80, pp. 41:1--41:16). [41] (Leibniz International Proceedings in Informatics (LIPIcs)). Dagstuhl, Germany: Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.ICALP.2017.41
  15. Published
    Mnich, M., & Teutrine, E-L. (2017). Improved bounds for minimal feedback vertex sets in tournaments. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) (pp. 24:1-24:10). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 63). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.IPEC.2016.24
  16. Published
    Mnich, M., & Schlotter, I. (2017). Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. In Algorithmic Game Theory. SAGT 2017 (pp. 320-332). (Lecture Notes in Computer Science; Vol. 10504). Springer. https://doi.org/10.1007/978-3-319-66700-3_25
  17. Published
    Knop, D., Koutecký, M., & Mnich, M. (2017). Voting and Bribing in Single-Exponential Time. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Vol. 66, pp. 46:1-46:14). [46] (Leibniz International Proceedings in Informatics (LIPIcs)). Dagstuhl, Germany: Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.STACS.2017.46
  18. 2016
  19. Published
  20. Published
  21. Published
    Mnich, M., Vassilevska Williams, V., & Végh, L. A. (2016). A 7/3-Approximation for Feedback Vertex Sets in Tournaments. In P. Sankowski, & C. Zaroliagis (Eds.), 24th Annual European Symposium on Algorithms (ESA 2016) (Vol. 57, pp. 67:1-67:14). [67] (Leibniz International Proceedings in Informatics). Dagstuhl: Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.ESA.2016.67
  22. Mnich, M. (2016). Large Independent Sets in Subquartic Planar Graphs. In M. Kaykobad, & R. Petreschi (Eds.), WALCOM: Algorithms and Computation: 10th International Workshop, WALCOM 2016 Kathmandu, Nepal March 29-31, 2016 Proceedings (pp. 209-221). (Lecture Notes in Computer Science (LNCS); Vol. 9627). Springer. https://doi.org/10.1007/978-3-319-30139-6_17
  23. Published
    Etscheid, M., & Mnich, M. (2016). Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. In 27th International Symposium on Algorithms and Computation (ISAAC 2016) (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 64). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.ISAAC.2016.31
  24. Mnich, M., Rutter, I., & Schmidt, J. M. (2016). Linear-Time Recognition of Map Graphs with Outerplanar Witness. In R. Pagh (Ed.), 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016) (pp. 5:1–5:14). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 53). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.SWAT.2016.5
  25. Published
    Mnich, M., Röglin, H., & Rösner, C. (2016). New deterministic algorithms for solving parity games. In LATIN 2016: Theoretical Informatics (pp. 634-645). (Lecture Notes in Computer Science; Vol. 9644). Springer. https://doi.org/10.1007/978-3-662-49529-2_47
  26. Ene, A., Mnich, M., Pilipczuk, M., & Risteski, A. (2016). On Routing Disjoint Paths in Bounded Treewidth Graphs. In R. Pagh (Ed.), 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016): Proceedings of a meeting held 22-24 June 2016, Reykjavik, Iceland. (pp. 15:1–15:15). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 53). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.SWAT.2016.15
  27. 2015
  28. Bringmann, K., Hermelin, D., Mnich, M., & van Leeuwen, E. J. (2015). Parameterized Complexity Dichotomy for Steiner Multicut. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) (Vol. 30, pp. 157-170). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 30). Schloss Dagstuhl.
  29. Etscheid, M., Kratsch, S., Mnich, M., & Röglin, H. (2015). Polynomial Kernels for Weighted Problems. In G. F. Italiano, G. Pighizzini, & D. T. Sannella (Eds.), Mathematical Foundations of Computer Science 2015: 40th International Symposium, MFCS 2015 Milan, Italy, August 24-28, 2015, Proceedings Part II (pp. 287-298). (Lecture Notes in Computer Science (LNCS); Vol. 9235). Springer. https://doi.org/10.1007/978-3-662-48054-0_24
  30. Mnich, M., Raj Shrestha, Y., & Yang, Y. (2015). When Does Schwartz' Conjecture Hold? In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) (pp. 603-609)
  31. 2014
  32. Dvorak, Z., & Mnich, M. (2014). Large Independent Sets in Triangle-Free Planar Graphs. In A. S. Schulz, & D. Wagner (Eds.), Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014 Proceedings (pp. 346-357). (Lecture Notes in Computer Science (LNCS); Vol. 8737). Springer. https://doi.org/10.1007/978-3-662-44777-2_29
  33. Mnich, M., & Wiese, A. (2014). Scheduling and Fixed-Parameter Tractability. In J. Lee, & J. Vygen (Eds.), Integer Programming and Combinatorial Optimization: 17th International Conference, IPCO 2014 Bonn, Germany, June 23-25, 2014 Proceedings (pp. 381-392). (Lecture Notes in Computer Science; Vol. 8494). Springer. https://doi.org/10.1007/978-3-319-07557-0_32
  34. Jacob, R., Lieber, T., & Mnich, M. (2014). Treewidth Computation and Kernelization in the Parallel External Memory Model. In J. Diaz, I. Lanese, & D. Sangiorgi (Eds.), Theoretical Computer Science: 8th IFIP TC1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014 Proceedings (pp. 78-89). (Lecture Notes in Computer Science; Vol. 8705). Springer. https://doi.org/10.1007/978-3-662-44602-7_7
  35. 2013
  36. 2012
  37. Mnich, M., Philip, G., Saurabh, S., & Suchy, O. (2012). Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzík Bound. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) (pp. 412-423). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 18). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.412
  38. Mnich, M., & Zenklusen, R. (2012). Bisections Above Tight Lower Bounds. In Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers (pp. 184-193). (Lecture Notes in Computer Science; Vol. 7551). Springer. https://doi.org/10.1007/978-3-642-34611-8_20
  39. van Bevern, R., Mnich, M., Niedermeier, R., & Weller, M. (2012). Interval Scheduling and Colorful Independent Sets. In K-M. Chao, T. Hsu, & D-T. Lee (Eds.), Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 2012 Proceedings (Vol. 7676, pp. 247-256). (Lecture Notes in Computer Science; Vol. 7676). Springer. https://doi.org/10.1007/978-3-642-35261-4_28
  40. Crowston, R., Jones, M., & Mnich, M. (2012). Max-Cut Parameterized above the Edwards-Erdős Bound. In A. Czumaj, K. Mehlhorn, A. Pitts, & R. Wattenhofer (Eds.), Automata, Languages and Programming: 39th International Colloquium, ICALP 2012, Warwick, UK, July 2012, Proceedings, Part I (pp. 242-253). (Lecture Notes in Computer Science; Vol. 7391). Springer. https://doi.org/10.1007/978-3-642-31594-7_21
  41. Hermelin, D., Mnich, M., & van Leeuwen, E. J. (2012). Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. In L. Epstein, & P. Ferragina (Eds.), Algorithms - ESA 2012: 20th Annual European Symposium Ljubljana, Slovenia, September 2012 Proceedings (pp. 624-635). (Lecture Notes in Computer Science; Vol. 7501). Springer. https://doi.org/10.1007/978-3-642-33090-2_54
  42. 2011
  43. Hermelin, D., Mnich, M., van Leeuwen, E. J., & Woeginger, G. J. (2011). Domination when the stars are out. In Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I (pp. 462-473). (Lecture Notes in Computer Science; Vol. 6755). Springer. https://doi.org/10.1007/978-3-642-22006-7_39
  44. Lokshtanov, D., Mnich, M., & Saurabh, S. (2011). Planar k-Path in Subexponential Time and Polynomial Space. In P. Kolman, & J. Kratochvil (Eds.), Graph-Theoretic Concepts in Computer Science: 37th International Workshop, WG 2011 Tepla Monastery, Czech Republic, June 2011 Revised Papers (pp. 262-270). (Lecture Notes in Computer Science; Vol. 6986). Springer. https://doi.org/10.1007/978-3-642-25870-1_24
  45. Fernau, H., Fomin, F. V., Lokshtanov, D., Mnich, M., Philip, G., & Saurabh, S. (2011). Ranking and Drawing in Subexponential Time. In C. S. Iliopoulos, & W. F. Smyth (Eds.), Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers (pp. 337-348). (Lecture Notes in Computer Science; Vol. 6460). Springer. https://doi.org/10.1007/978-3-642-19222-7_34
  46. 2010
Previous 1 2 Next