Publications

See also my dblp and Google Scholar profiles or download my complete bibtex file.

Book chapter

1. Complexity of Arc Routing Problems
   Bevern, R. van, Niedermeier, R., Sorge, M., Weller, M. In: Arc Routing: Problems, Methods, and Applications. pp. 19–52. SIAM (2014).
   (pdf) (orig)

   (bib)

   @incollection{BNSW14,
     title = {Complexity of Arc Routing Problems},
     author = {van Bevern, René and Niedermeier, Rolf and Sorge, Manuel and Weller, Mathias},
     booktitle = {Arc Routing: Problems, Methods, and Applications},
     publisher = {SIAM},
     year = {2014},
     isbn = {9781611973662},
     url = {http://bit.ly/arc-routing-complexity},
     url2 = {http://bookstore.siam.org/mo20/},
     pages = {19--52}
   }
   

   
   

Journal and conference articles

1. Optimal Discretization is Fixed-parameter Tractable
   Kratsch, S., Masarı́k Tomás, Muzi, I., Pilipczuk, M., Sorge, M. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA ’21). SIAM (2021).
   (pdf)

   (bib)

   @inproceedings{KMMPS21,
     author = {Kratsch, Stefan and Masar{\'{\i}}k, Tom{\'{a}}s and Muzi, Irene and Pilipczuk, Marcin and Sorge, Manuel},
     title = {Optimal Discretization is Fixed-parameter Tractable},
     booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on
                       Discrete Algorithms (SODA '21)},
     year = {2021},
     url = {https://arxiv.org/abs/2003.02475},
     publisher = {SIAM},
     note = {Accepted.},
     pages = {}
   }
   

   
   
2. Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
   Chen, J., Czerwinski, W., Disser, Y., Feldmann, A.E., Hermelin, D., Nadara, W., Pilipczuk, M., Pilipczuk, M., Sorge, M., Wróblewski, B., Zych-Pawlewicz, A. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA ’21). SIAM (2021).
   (pdf)

   (bib)

   @inproceedings{CCD+21,
     author = {Chen, Jiehua and Czerwinski, Wojciech and Disser, Yann and Feldmann, Andreas Emil and Hermelin, Danny and Nadara, Wojciech and Pilipczuk, Michal and Pilipczuk, Marcin and Sorge, Manuel and Wr{\'{o}}blewski, Bartlomiej and Zych{-}Pawlewicz, Anna},
     title = {Efficient fully dynamic elimination forests with applications to detecting long paths and cycles},
     booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on
                       Discrete Algorithms (SODA '21)},
     year = {2021},
     url = {https://arxiv.org/abs/2006.00571},
     publisher = {SIAM},
     pages = {},
     note = {Accepted.}
   }
   

   
   
3. The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
   Bellitto, T., Li, S., Okrasa, K., Pilipczuk, M., Sorge, M. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC ’20). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2020).
   (pdf)

   (bib)

   @inproceedings{BLOPS20,
     title = {The Complexity of Connectivity Problems in
                       Forbidden-Transition Graphs and Edge-Colored Graphs},
     author = {Bellitto, Thomas and Li, Shaohua and Okrasa, Karolina and Pilipczuk, Marcin and Sorge, Manuel},
     booktitle = {Proceedings of the 31st International Symposium on
                       Algorithms and Computation (ISAAC '20)},
     year = {2020},
     series = {LIPIcs},
     publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
     url = {https://arxiv.org/abs/2009.12892},
     pages = {},
     note = {Accepted.}
   }
   

   
   
4. A Double Exponential Lower Bound for the Distinct Vectors Problem
   Pilipczuk, M., Sorge, M. Discrete Mathematics & Theoretical Computer Science. 22, 1–4 (2020).
   (pdf) (orig)

   (bib)

   @article{PS20,
     title = {A Double Exponential Lower Bound for the Distinct
                       Vectors Problem},
     author = {Pilipczuk, Marcin and Sorge, Manuel},
     url = {https://arxiv.org/abs/2002.01293v3},
     journal = {Discrete Mathematics \& Theoretical Computer
                       Science},
     volume = {22},
     issue = {4},
     year = {2020},
     url2 = {https://dmtcs.episciences.org/6789},
     pages = {1--4}
   }
   

   
   
5. Threshold Treewidth and Hypertree Width
   Ganian, R., Schidler, A., Sorge, M., Szeider, S. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020. pp. 1898–1904. AAAI Press (2020).
   (orig)

   (bib)

   @inproceedings{GSSS20,
     author = {Ganian, Robert and Schidler, Andr{\'{e}} and Sorge, Manuel and Szeider, Stefan},
     title = {Threshold Treewidth and Hypertree Width},
     booktitle = {Proceedings of the Twenty-Ninth International Joint
                       Conference on Artificial Intelligence, {IJCAI} 2020},
     pages = {1898--1904},
     publisher = {AAAI Press},
     year = {2020},
     url2 = {https://doi.org/10.24963/ijcai.2020/263},
     doi = {10.24963/ijcai.2020/263}
   }
   

   
   
6. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
   Kanj, I.A., Komusiewicz, C., Sorge, M., Leeuwen, E.J. van. SIAM Journal on Discrete Mathematics. 34, 640–681 (2020).
   (pdf) (orig)

   (bib)

   @article{KKSL20j,
     author = {Kanj, Iyad A. and Komusiewicz, Christian and Sorge, Manuel and van Leeuwen, Erik Jan},
     title = {Solving Partition Problems Almost Always Requires
                       Pushing Many Vertices Around},
     journal = {SIAM Journal on Discrete Mathematics},
     year = {2020},
     volume = {34},
     issue = {1},
     pages = {640--681},
     url2 = {https://doi.org/10.1137/19M1239362},
     url = {https://arxiv.org/abs/1808.08772},
     doi = {10.1137/19M1239362}
   }
   

   
   
7. Efficient Algorithms for Measuring the Funnel-Likeness of DAGs
   Millani, M.G., Molter, H., Niedermeier, R., Sorge, M. Journal of Combinatorial Optimization. 39, 216–245 (2020).
   (pdf) (orig)

   (bib)

   @article{MMNS20,
     author = {Millani, Marcelo Garlet and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel},
     title = {Efficient Algorithms for Measuring the
                       Funnel-Likeness of DAGs},
     journal = {Journal of Combinatorial Optimization},
     pages = {216--245},
     url2 = {https://doi.org/10.1007/s10878-019-00464-4},
     url = {https://arxiv.org/abs/1801.10401},
     doi = {10.1007/s10878-019-00464-4},
     volume = {39},
     issue = {1},
     publisher = {Springer},
     year = {2020}
   }
   

   
   
8. On Computing Centroids According to the p-Norms of Hamming Distance Vectors
   Chen, J., Hermelin, D., Sorge, M. In: Proceedings of the 27th Annual European Symposium on Algorithms (ESA ’19). pp. 28:1–28:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019).
   (pdf) (orig)

   (bib)

   @inproceedings{CHS19,
     author = {Chen, Jiehua and Hermelin, Danny and Sorge, Manuel},
     title = {On Computing Centroids According to the $p$-Norms of
                       Hamming Distance Vectors},
     booktitle = {Proceedings of the 27th Annual European Symposium on
                       Algorithms (ESA '19)},
     series = {LIPIcs},
     volume = {144},
     year = {2019},
     pages = {28:1--28:16},
     url = {https://arxiv.org/abs/1807.06469},
     url2 = {https://doi.org/10.4230/LIPIcs.ESA.2019.28},
     doi = {10.4230/LIPIcs.ESA.2019.28},
     publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}
   }
   

   
   
9. Packing directed circuits quarter-integrally
   Masařík, T., Muzi, I., Pilipczuk, M., Rzążewski, P., Sorge, M. In: Proceedings of the 27th Annual European Symposium on Algorithms (ESA ’19). pp. 72:1–72:13 (2019).
   (pdf) (orig)

   (bib)

   @inproceedings{KMMPRS19,
     author = {Masa\v{r}\'{i}k, Tom\'{a}\v{s} and Muzi, Irene and Pilipczuk, Marcin and Rz\k{a}\.{z}ewski, Pawe\l{} and Sorge, Manuel},
     title = {Packing directed circuits quarter-integrally},
     booktitle = {Proceedings of the 27th Annual European Symposium on
                       Algorithms (ESA '19)},
     year = {2019},
     series = {LIPIcs},
     volume = {144},
     pages = {72:1--72:13},
     url = {https://arxiv.org/abs/1907.02494},
     url2 = {https://doi.org/10.4230/LIPIcs.ESA.2019.72},
     doi = {10.4230/LIPIcs.ESA.2019.72}
   }
   

   
   
10. Matchings under Preferences: Strength of Stability and Trade-offs
    Chen, J., Skowron, P., Sorge, M. In: Proceedings of the 20th ACM Conference on Economics and Computation (EC ’19). pp. 41–59. ACM (2019).
    (pdf) (orig)

    (bib)

    @inproceedings{CSS19,
      author = {Chen, Jiehua and Skowron, Piotr and Sorge, Manuel},
      title = {Matchings under Preferences: Strength of Stability
                        and Trade-offs},
      booktitle = {Proceedings of the 20th ACM Conference on Economics
                        and Computation (EC '19)},
      year = {2019},
      pages = {41--59},
      publisher = {ACM},
      url = {https://arxiv.org/abs/1902.10535},
      url2 = {https://doi.org/10.1145/3328526.3329555},
      doi = {10.1145/3328526.3329555}
    }
    

    
    
11. Your Rugby Mates Don’t Need to Know your Colleagues: Triadic Closure with Edge Colors
    Bulteau, L., Grüttemeier, N., Komusiewicz, C., Sorge, M. In: Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC ’19). pp. 99–111. Springer (2019).
    (pdf) (orig)

    (bib)

    @inproceedings{BGKS19,
      author = {Bulteau, Laurent and Grüttemeier, Niels and Komusiewicz, Christian and Sorge, Manuel},
      title = {Your Rugby Mates Don’t Need to Know your Colleagues:
                        Triadic Closure with Edge Colors},
      booktitle = {Proceedings of the 11th International Conference on
                        Algorithms and Complexity (CIAC '19)},
      series = {Lecture Notes in Computer Science},
      volume = {11485},
      year = {2019},
      pages = {99--111},
      publisher = {Springer},
      url = {https://arxiv.org/abs/1811.09411},
      url2 = {https://doi.org/10.1007/978-3-030-17402-6\_9},
      doi = {10.1007/978-3-030-17402-6\_9}
    }
    

    
    
12. The Complexity of Routing with Collision Avoidance
    Fluschnik, T., Morik, M., Sorge, M. Journal of Computer and System Sciences. 102, 69–86 (2019).
    (pdf) (orig)

    (bib)

    @article{FMS19j,
      author = {Fluschnik, Till and Morik, Marco and Sorge, Manuel},
      title = {The Complexity of Routing with Collision Avoidance},
      journal = {Journal of Computer and System Sciences},
      volume = {102},
      pages = {69--86},
      year = {2019},
      url = {https://arxiv.org/abs/1705.03673},
      url2 = {https://doi.org/10.1016/j.jcss.2019.01.001},
      doi = {10.1016/j.jcss.2019.01.001}
    }
    

    
    
13. The Parameterized Complexity of the Minimum Shared Edges Problem
    Fluschnik, T., Kratsch, S., Niedermeier, R., Sorge, M. Journal of Computer and System Sciences. 106, 23–46 (2019).
    (pdf) (orig)

    (bib)

    @article{FKNS19j,
      author = {Fluschnik, Till and Kratsch, Stefan and Niedermeier, Rolf and Sorge, Manuel},
      title = {The Parameterized Complexity of the Minimum Shared
                        Edges Problem},
      journal = {Journal of Computer and System Sciences},
      volume = {106},
      pages = {23--46},
      doi = {10.1016/j.jcss.2018.12.002},
      year = {2019},
      url = {http://arxiv.org/abs/1602.01739},
      url2 = {https://doi.org/10.1016/j.jcss.2018.12.002}
    }
    

    
    
14. Assessing the Computational Complexity of Multi-Layer Subgraph Detection
    Bredereck, R., Komusiewicz, C., Kratsch, S., Molter, H., Niedermeier, R., Sorge, M. Network Science. 7, 215–241 (2019).
    (pdf) (orig)

    (bib)

    @article{BKKMNS19j,
      author = {Bredereck, Robert and Komusiewicz, Christian and Kratsch, Stefan and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel},
      title = {Assessing the Computational Complexity of
                        Multi-Layer Subgraph Detection},
      journal = {Network Science},
      volume = {7},
      issue = {2},
      pages = {215--241},
      year = {2019},
      publisher = {Cambridge University Press},
      url = {https://arxiv.org/abs/1604.07724},
      url2 = {https://doi.org/10.1017/nws.2019.13}
    }
    

    
    
15. The Minimum Feasible Tileset problem
    Disser, Y., Kratsch, S., Sorge, M. Algorithmica. 81, 1126–1151 (2019).
    (pdf) (orig)

    (bib)

    @article{DKS19j,
      author = {Disser, Yann and Kratsch, Stefan and Sorge, Manuel},
      title = {The Minimum Feasible Tileset problem},
      journal = {Algorithmica},
      volume = {81},
      number = {3},
      pages = {1126--1151},
      year = {2019},
      url = {http://arxiv.org/abs/1409.8524},
      url2 = {https://doi.org/10.1007/s00453-018-0460-3},
      doi = {10.1007/s00453-018-0460-3}
    }
    

    
    
16. Computational Complexity Aspects of Point Visibility Graphs
    Himmel, A.-S., Hoffmann, C., Kunz, P., Froese, V., Sorge, M. Discrete Applied Mathematics. 254, 283–290 (2019).
    (pdf) (orig)

    (bib)

    @article{HHKFS19j,
      title = {Computational Complexity Aspects of Point Visibility
                        Graphs},
      author = {Himmel, Anne-Sophie and Hoffmann, Clemens and Kunz, Pascal and Froese, Vincent and Sorge, Manuel},
      journal = {Discrete Applied Mathematics},
      volume = {254},
      pages = {283--290},
      year = {2019},
      url = {http://arxiv.org/abs/1711.01811},
      url2 = {https://doi.org/10.1016/j.dam.2018.06.016},
      doi = {10.1016/j.dam.2018.06.016}
    }
    

    
    
17. The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
    Bevern, R. van, Fluschnik, T., Mertzios, G.B., Molter, H., Sorge, M., Suchý, O. Discrete Optimization. 30, 20–50 (2018).
    (pdf) (orig)

    (bib)

    @article{BFMMSO18j,
      author = {van Bevern, Ren{\'{e}} and Fluschnik, Till and Mertzios, George B. and Molter, Hendrik and Sorge, Manuel and Such{\'{y}}, Ondrej},
      title = {The parameterized complexity of finding secluded
                        solutions to some classical optimization problems on
                        graphs},
      journal = {Discrete Optimization},
      year = {2018},
      volume = {30},
      pages = {20--50},
      url = {http://arxiv.org/abs/1606.09000},
      url2 = {https://doi.org/10.1016/j.disopt.2018.05.002},
      doi = {10.1016/j.disopt.2018.05.002}
    }
    

    
    
18. Cluster Editing in Multi-Layer and Temporal Graphs
    Chen, J., Suchý, O., Molter, H., Sorge, M. In: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC ’18). pp. 24:1–24:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018).
    (pdf) (orig)

    (bib)

    @inproceedings{CMSS18,
      author = {Chen, Jiehua and Such{\'{y}}, Ondrej and Molter, Hendrik and Sorge, Manuel},
      title = {Cluster Editing in Multi-Layer and Temporal Graphs},
      booktitle = {Proceedings of the 29th International Symposium on
                        Algorithms and Computation ({ISAAC} '18)},
      pages = {24:1--24:13},
      year = {2018},
      url = {https://arxiv.org/abs/1709.09100},
      url2 = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.24},
      doi = {10.4230/LIPIcs.ISAAC.2018.24},
      series = {LIPIcs},
      volume = {123},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}
    }
    

    
    
19. Matching algorithms for assigning orthologs after genome duplication events
    Fertin, G., Hüffner, F., Komusiewicz, C., Sorge, M. Computational Biology and Chemistry. 74, 379–390 (2018).
    (orig)

    (bib)

    @article{FHKS18j,
      author = {Fertin, Guillaume and H{\"{u}}ffner, Falk and Komusiewicz, Christian and Sorge, Manuel},
      title = {Matching algorithms for assigning orthologs after
                        genome duplication events},
      journal = {Computational Biology and Chemistry},
      volume = {74},
      pages = {379--390},
      year = {2018},
      url2 = {https://doi.org/10.1016/j.compbiolchem.2018.03.015},
      doi = {10.1016/j.compbiolchem.2018.03.015}
    }
    

    
    
20. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
    Kanj, I.A., Komusiewicz, C., Sorge, M., Leeuwen, E.J. van. In: Proceedings of the 26th Annual European Symposium on Algorithms (ESA ’18). pp. 51:1–51:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018).
    (pdf) (orig)

    (bib)

    @inproceedings{KKSL18,
      author = {Kanj, Iyad A. and Komusiewicz, Christian and Sorge, Manuel and van Leeuwen, Erik Jan},
      title = {Solving Partition Problems Almost Always Requires
                        Pushing Many Vertices Around},
      booktitle = {Proceedings of the 26th Annual European Symposium on
                        Algorithms ({ESA} '18)},
      pages = {51:1--51:14},
      year = {2018},
      url2 = {https://doi.org/10.4230/LIPIcs.ESA.2018.51},
      url = {https://arxiv.org/abs/1808.08772},
      doi = {10.4230/LIPIcs.ESA.2018.51},
      series = {LIPIcs},
      volume = {112},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}
    }
    

    
    
21. How Hard Is It to Satisfy (Almost) All Roommates?
    Chen, J., Hermelin, D., Sorge, M., Yedidsion, H. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP ’18). pp. 35:1–35:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018).
    (pdf) (orig)

    (bib)

    @inproceedings{CHSY18,
      author = {Chen, Jiehua and Hermelin, Danny and Sorge, Manuel and Yedidsion, Harel},
      title = {How Hard Is It to Satisfy (Almost) All Roommates?},
      booktitle = {Proceedings of the 45th International Colloquium on
                        Automata, Languages, and Programming ({ICALP} '18)},
      pages = {35:1--35:15},
      year = {2018},
      url2 = {https://doi.org/10.4230/LIPIcs.ICALP.2018.35},
      url = {https://arxiv.org/abs/1707.04316},
      doi = {10.4230/LIPIcs.ICALP.2018.35},
      series = {LIPIcs},
      volume = {107},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}
    }
    

    
    
22. Efficient Algorithms for Measuring the Funnel-Likeness of DAGs
    Millani, M.G., Molter, H., Niedermeier, R., Sorge, M. In: Proceedings of the 5th International Symposium on Combinatorial Optimization (ISCO ’18). pp. 183–195. Springer (2018).
    (pdf) (orig)

    (bib)

    @inproceedings{MMNS18,
      author = {Millani, Marcelo Garlet and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel},
      title = {Efficient Algorithms for Measuring the
                        Funnel-Likeness of DAGs},
      booktitle = {Proceedings of the 5th International Symposium on
                        Combinatorial Optimization ({ISCO} '18)},
      pages = {183--195},
      url = {https://doi.org/10.1007/978-3-319-96151-4\_16},
      url2 = {https://arxiv.org/abs/1801.10401},
      doi = {10.1007/978-3-319-96151-4\_16},
      series = {Lecture Notes in Computer Science},
      volume = {10856},
      publisher = {Springer},
      year = {2018}
    }
    

    
    
23. The Parameterized Complexity of Centrality Improvement in Networks
    Hoffmann, C., Molter, H., Sorge, M. In: Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM ’18). pp. 111–124. Springer (2018).
    (pdf) (orig)

    (bib)

    @inproceedings{HMS18,
      author = {Hoffmann, Clemens and Molter, Hendrik and Sorge, Manuel},
      title = {The Parameterized Complexity of Centrality
                        Improvement in Networks},
      booktitle = {Proceedings of the 44th International Conference on
                        Current Trends in Theory and Practice of Computer
                        Science (SOFSEM '18)},
      pages = {111--124},
      year = {2018},
      doi = {10.1007/978-3-319-73117-9_8},
      url = {https://doi.org/10.1007/978-3-319-73117-9_8},
      url2 = {http://arxiv.org/abs/1710.01576},
      series = {Lecture Notes in Computer Science},
      volume = {10706},
      publisher = {Springer}
    }
    

    
    
24. Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
    Kanj, I.A., Komusiewicz, C., Sorge, M., Leeuwen, E.J. van. Journal of Computer and System Sciences. 92, 22–47 (2018).
    (pdf) (orig)

    (bib)

    @article{KKSL18j,
      author = {Kanj, Iyad A. and Komusiewicz, Christian and Sorge, Manuel and van Leeuwen, Erik Jan},
      title = {Parameterized algorithms for recognizing monopolar
                        and 2-subcolorable graphs},
      journal = {Journal of Computer and System Sciences},
      volume = {92},
      pages = {22--47},
      year = {2018},
      url = {https://arxiv.org/abs/1702.04322},
      url2 = {https://doi.org/10.1016/j.jcss.2017.08.002}
    }
    

    
    
25. A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
    Bevern, R. van, Komusiewicz, C., Sorge, M. Networks. 70, 262–278 (2017).
    (pdf) (orig)

    (bib)

    @article{BKS17j,
      author = {van Bevern, Ren{\'{e}} and Komusiewicz, Christian and Sorge, Manuel},
      title = {A parameterized approximation algorithm for the
                        mixed and windy capacitated arc routing problem:
                        Theory and experiments},
      journal = {Networks},
      volume = {70},
      number = {3},
      pages = {262--278},
      year = {2017},
      url = {https://arxiv.org/abs/1506.05620},
      url2 = {https://doi.org/10.1002/net.21742}
    }
    

    
    
26. The Complexity of Routing with Few Collisions
    Fluschnik, T., Morik, M., Sorge, M. In: Proceedings of the 21st International Symposium on Fundamentals of Computation Theory (FCT ’17). pp. 257–270. Springer (2017).
    (pdf) (orig)

    (bib)

    @inproceedings{FMS17,
      author = {Fluschnik, Till and Morik, Marco and Sorge, Manuel},
      title = {The Complexity of Routing with Few Collisions},
      booktitle = {Proceedings of the 21st International Symposium on
                        Fundamentals of Computation Theory (FCT '17)},
      pages = {257--270},
      year = {2017},
      url = {https://arxiv.org/abs/1705.03673},
      url2 = {https://doi.org/10.1007/978-3-662-55751-8_21},
      doi = {10.1007/978-3-662-55751-8_21},
      series = {Lecture Notes in Computer Science},
      volume = {10472},
      publisher = {Springer}
    }
    

    
    
27. Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs
    Himmel, A.-S., Molter, H., Niedermeier, R., Sorge, M. Social Network Analysis and Mining. 7, 35:1–35:16 (2017).
    (pdf) (orig)

    (bib)

    @article{HMNS17j,
      author = {Himmel, Anne{-}Sophie and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel},
      title = {Adapting the {Bron-Kerbosch} algorithm for
                        enumerating maximal cliques in temporal graphs},
      journal = {Social Network Analysis and Mining},
      volume = {7},
      number = {1},
      pages = {35:1--35:16},
      year = {2017},
      url = {https://arxiv.org/abs/1605.03871},
      url2 = {https://doi.org/10.1007/s13278-017-0455-0},
      doi = {10.1007/s13278-017-0455-0}
    }
    

    
    
28. Finding Secluded Places of Special Interest in Graphs
    Bevern, R. van, Fluschnik, T., Mertzios, G.B., Molter, H., Sorge, M., Suchý, O. In: Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC ’16). pp. 5:1–5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017).
    (pdf) (orig)

    (bib)

    @inproceedings{BFMMSO17,
      author = {van Bevern, Ren{\'{e}} and Fluschnik, Till and Mertzios, George B. and Molter, Hendrik and Sorge, Manuel and Such{\'{y}}, Ondrej},
      title = {Finding Secluded Places of Special Interest in
                        Graphs},
      booktitle = {Proceedings of the 11th International Symposium on
                        Parameterized and Exact Computation (IPEC '16)},
      year = {2017},
      volume = {63},
      series = {LIPIcs},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"{u}r
                        Informatik},
      pages = {5:1--5:16},
      url = {http://arxiv.org/abs/1606.09000},
      url2 = {http://dx.doi.org/10.4230/LIPIcs.IPEC.2016.5}
    }
    

    
    
29. Assessing the Computational Complexity of Multi-Layer Subgraph Detection
    Bredereck, R., Komusiewicz, C., Kratsch, S., Molter, H., Niedermeier, R., Sorge, M. In: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC ’17). pp. 128–139. Springer (2017).
    (pdf) (orig)

    (bib)

    @inproceedings{BKKMNS17,
      author = {Bredereck, Robert and Komusiewicz, Christian and Kratsch, Stefan and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel},
      title = {Assessing the Computational Complexity of
                        Multi-Layer Subgraph Detection},
      booktitle = {Proceedings of the 10th International Conference on
                        Algorithms and Complexity (CIAC '17)},
      year = {2017},
      publisher = {Springer},
      pages = {128--139},
      volume = {10236},
      series = {LNCS},
      doi = {10.1007/978-3-319-57586-5_12},
      url = {https://arxiv.org/abs/1604.07724},
      url2 = {http://link.springer.com/chapter/10.1007/978-3-319-57586-5_12}
    }
    

    
    
30. On Kernelization and Approximation for the Vector Connectivity Problem
    Kratsch, S., Sorge, M. Algorithmica. 79, 96–138 (2017).
    (pdf) (orig)

    (bib)

    @article{KS17j,
      author = {Kratsch, Stefan and Sorge, Manuel},
      title = {On Kernelization and Approximation for the Vector
                        Connectivity Problem},
      journal = {Algorithmica},
      volume = {79},
      number = {1},
      pages = {96--138},
      year = {2017},
      doi = {10.1007/s00453-016-0231-y},
      url = {https://arxiv.org/abs/1410.8819},
      url2 = {http://dx.doi.org/10.1007/s00453-016-0231-y}
    }
    

    
    
31. Exploiting hidden structure in selecting dimensions that distinguish vectors
    Froese, V., Bevern, R. van, Niedermeier, R., Sorge, M. Journal of Computer and System Sciences. 82, 521–535 (2016).
    (pdf) (orig)

    (bib)

    @article{FBNS16j,
      author = {Froese, Vincent and van Bevern, Ren{\'{e}} and Niedermeier, Rolf and Sorge, Manuel},
      title = {Exploiting hidden structure in selecting dimensions
                        that distinguish vectors},
      journal = {Journal of Computer and System Sciences},
      volume = {82},
      number = {3},
      pages = {521--535},
      year = {2016},
      url = {https://arxiv.org/abs/1512.01150},
      url2 = {https://doi.org/10.1016/j.jcss.2015.11.011},
      doi = {10.1016/j.jcss.2015.11.011}
    }
    

    
    
32. H-index manipulation by merging articles: Models, theory, and experiments
    Bevern, R. van, Komusiewicz, C., Niedermeier, R., Sorge, M., Walsh, T. Artificial Intelligence. 240, 19–35 (2016).
    (pdf) (orig)

    (bib)

    @article{BKNSW16j,
      author = {van Bevern, Ren{\'{e}} and Komusiewicz, Christian and Niedermeier, Rolf and Sorge, Manuel and Walsh, Toby},
      title = {H-index manipulation by merging articles: Models,
                        theory, and experiments},
      journal = {Artificial Intelligence},
      volume = {240},
      pages = {19--35},
      year = {2016},
      url = {https://arxiv.org/abs/1412.5498v3},
      url2 = {https://doi.org/10.1016/j.artint.2016.08.001},
      doi = {10.1016/j.artint.2016.08.001}
    }
    

    
    
33. Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
    Kanj, I.A., Komusiewicz, C., Sorge, M., Leeuwen, E.J. van. In: Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT ’16). pp. 14:1–14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016).
    (pdf) (orig)

    (bib)

    @inproceedings{KKSL16,
      author = {Kanj, Iyad A. and Komusiewicz, Christian and Sorge, Manuel and van Leeuwen, Erik Jan},
      title = {Parameterized algorithms for recognizing monopolar
                        and 2-subcolorable graphs},
      booktitle = {Proceedings of the 15th Scandinavian Symposium and
                        Workshops on Algorithm Theory (SWAT '16)},
      year = {2016},
      series = {LIPIcs},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"{u}r
                        Informatik},
      url = {http://fpt.akt.tu-berlin.de/publications/inductive-recognition-SWAT.pdf},
      url2 = {http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.14},
      volume = {53},
      pages = {14:1--14:14}
    }
    

    
    
34. Twins in Subdivision Drawings of Hypergraphs
    Bevern, R. van, Kanj, I.A., Komusiewicz, C., Niedermeier, R., Sorge, M. In: Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization (GD ’16). pp. 67–80. Springer (2016).
    (pdf) (orig)

    (bib)

    @inproceedings{BKKNS16,
      author = {van Bevern, Ren{\'{e}} and Kanj, Iyad A. and Komusiewicz, Christian and Niedermeier, Rolf and Sorge, Manuel},
      title = {Twins in Subdivision Drawings of Hypergraphs},
      booktitle = {Proceedings of the 24th International Symposium on
                        Graph Drawing \& Network Visualization (GD '16)},
      year = {2016},
      volume = {9801},
      pages = {67--80},
      series = {LNCS},
      publisher = {Springer},
      url = {http://arxiv.org/abs/1511.09389},
      url2 = {http://dx.doi.org/10.1007/978-3-319-50106-2}
    }
    

    
    
35. H-Index Manipulation by Undoing Merges
    Bevern, R. van, Molter, H., Komusiewicz, C., Niedermeier, R., Sorge, M., Walsh, T. In: Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI ’16). pp. 895–903. IOS Press (2016).
    (pdf) (orig)

    (bib)

    @inproceedings{BKMNSW16,
      author = {van Bevern, Ren{\'{e}} and Molter, Hendrik and Komusiewicz, Christian and Niedermeier, Rolf and Sorge, Manuel and Walsh, Toby},
      title = {{H-Index} Manipulation by Undoing Merges},
      booktitle = {Proceedings of the 22nd European Conference on
                        Artificial Intelligence (ECAI '16)},
      year = {2016},
      series = {Frontiers in Artificial Intelligence and
                        Applications},
      volume = {285},
      pages = {895--903},
      publisher = {{IOS} Press},
      doi = {10.3233/978-1-61499-672-9-895},
      url = {http://arxiv.org/abs/1606.09000},
      url2 = {http://dx.doi.org/10.3233/978-1-61499-672-9-895}
    }
    

    
    
36. Enumerating maximal cliques in temporal graphs
    Himmel, A.-S., Molter, H., Niedermeier, R., Sorge, M. In: Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (ASONAM ’16). pp. 337–344. IEEE Computer Society (2016).
    (pdf) (orig)

    (bib)

    @inproceedings{HMNS16,
      author = {Himmel, Anne-Sophie and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel},
      title = {Enumerating maximal cliques in temporal graphs},
      booktitle = {Proceedings of the 2016 {IEEE/ACM} International
                        Conference on Advances in Social Networks Analysis
                        and Mining, ({ASONAM} '16)},
      year = {2016},
      pages = {337--344},
      publisher = {{IEEE} Computer Society},
      doi = {10.1109/ASONAM.2016.7752255},
      url = {https://arxiv.org/abs/1605.03871},
      url2 = {http://dx.doi.org/10.1109/ASONAM.2016.7752255}
    }
    

    
    
37. The Parameterized Complexity of the Minimum Shared Edges Problem
    Fluschnik, T., Kratsch, S., Niedermeier, R., Sorge, M. In: Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS ’15). pp. 448–462. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015).
    (pdf) (orig)

    (bib)

    @inproceedings{FKNS15,
      author = {Fluschnik, Till and Kratsch, Stefan and Niedermeier, Rolf and Sorge, Manuel},
      title = {The Parameterized Complexity of the Minimum Shared
                        Edges Problem},
      booktitle = {Proceedings of the 35th {IARCS} Annual Conference on
                        Foundation of Software Technology and Theoretical
                        Computer Science ({FSTTCS} '15)},
      pages = {448--462},
      year = {2015},
      series = {LIPIcs},
      volume = {45},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f\"{u}r
                        Informatik},
      url = {http://arxiv.org/abs/1602.01739},
      url2 = {http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=5632}
    }
    

    
    
38. Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
    Bevern, R. van, Komusiewicz, C., Sorge, M. In: Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS ’15). pp. 130–143. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015).
    (pdf) (orig)

    (bib)

    @inproceedings{BKS15,
      author = {van Bevern, René and Komusiewicz, Christian and Sorge, Manuel},
      title = {Approximation Algorithms for Mixed, Windy, and
                        Capacitated Arc Routing Problems},
      booktitle = {Proceedings of the 15th Workshop on Algorithmic
                        Approaches for Transportation Modeling,
                        Optimization, and Systems (ATMOS '15)},
      year = {2015},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
      series = {OASIcs},
      url = {http://fpt.akt.tu-berlin.de/publications/mwcarp-atmos15.pdf},
      url2 = {http://dx.doi.org/10.4230/OASIcs.ATMOS.2015.130},
      volume = {48},
      pages = {130--143}
    }
    

    
    
39. H-Index Manipulation by Merging Articles: Models, Theory, and Experiments
    Bevern, R. van, Komusiewicz, C., Niedermeier, R., Sorge, M., Walsh, T. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI ’15). pp. 808–814. AAAI Press (2015).
    (pdf) (orig)

    (bib)

    @inproceedings{BKNSW15,
      author = {van Bevern, René and Komusiewicz, Christian and Niedermeier, Rolf and Sorge, Manuel and Walsh, Toby},
      title = {{H-Index} Manipulation by Merging Articles: Models,
                        Theory, and Experiments},
      booktitle = {Proceedings of the 24th International Joint
                        Conference on Artificial Intelligence (IJCAI '15)},
      year = {2015},
      publisher = {AAAI Press},
      url = {http://fpt.akt.tu-berlin.de/publications/hindex-short-web.pdf},
      url2 = {http://dl.acm.org/citation.cfm?id=2832249.2832361},
      pages = {808--814}
    }
    

    
    
40. Finding Highly Connected Subgraphs
    Hüffner, F., Komusiewicz, C., Sorge, M. In: Proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM ’15). pp. 254–265. Springer (2015).
    (pdf) (orig)

    (bib)

    @inproceedings{HKS15,
      author = {Hüffner, Falk and Komusiewicz, Christian and Sorge, Manuel},
      title = {Finding Highly Connected Subgraphs},
      booktitle = {Proceedings of the 41st International Conference on
                        Current Trends in Theory and Practice of Computer
                        Science (SOFSEM '15)},
      year = {2015},
      pages = {254--265},
      volume = {8939},
      series = {LNCS},
      publisher = {Springer},
      url = {http://fpt.akt.tu-berlin.de/publications/Finding_Highly_Connected_Subgraphs-SOFSEM.pdf},
      url2 = {http://dx.doi.org/10.1007/978-3-662-46078-8_21}
    }
    

    
    
41. Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments
    Komusiewicz, C., Sorge, M., Stahl, K. In: Proceedings of the 14th International Symposium on Experimental Algorithms (SEA ’15). pp. 82–93. Springer (2015).
    (pdf) (orig)

    (bib)

    @inproceedings{KSS15,
      author = {Komusiewicz, Christian and Sorge, Manuel and Stahl, Kolja},
      booktitle = {Proceedings of the 14th International Symposium on
                        Experimental Algorithms (SEA '15)},
      title = {Finding Connected Subgraphs of Fixed Minimum
                        Density: Implementation and Experiments},
      year = {2015},
      url = {http://fpt.akt.tu-berlin.de/publications/mu-clique-website.pdf},
      url2 = {https://doi.org/10.1007/978-3-319-20086-6_7},
      series = {LNCS},
      publisher = {Springer},
      volume = {9125},
      pages = {82--93}
    }
    

    
    
42. On Kernelization and Approximation for the Vector Connectivity Problem
    Kratsch, S., Sorge, M. In: Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC ’15). pp. 377–388. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015).
    (pdf) (orig)

    (bib)

    @inproceedings{KS15,
      author = {Kratsch, Stefan and Sorge, Manuel},
      title = {On Kernelization and Approximation for the Vector
                        Connectivity Problem},
      booktitle = {Proceedings of the 10th International Symposium on
                        Parameterized and Exact Computation ({IPEC}~'15)},
      pages = {377--388},
      year = {2015},
      series = {LIPIcs},
      volume = {43},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
      url = {http://arxiv.org/abs/1410.8819},
      url2 = {http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.377}
    }
    

    
    
43. Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
    Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Suchý, O., Weller, M. SIAM Journal on Discrete Mathematics. 29, 1–25 (2015).
    (pdf) (orig)

    (bib)

    @article{CKNSSW15j,
      author = {Chen, Jiehua and Komusiewicz, Christian and Niedermeier, Rolf and Sorge, Manuel and Such\'y, Ondrej and Weller, Mathias},
      title = {Polynomial-Time Data Reduction for the Subset
                        Interconnection Design Problem},
      journal = {SIAM Journal on Discrete Mathematics},
      year = {2015},
      url = {http://fpt.akt.tu-berlin.de/publications/Subset_Interconnection_Design-SIDMA.pdf},
      url2 = {http://dx.doi.org/10.1137/140955057},
      volume = {29},
      number = {1},
      pages = {1--25}
    }
    

    
    
44. An Algorithmic Framework for Fixed-Cardinality Optimization in Sparse Graphs Applied to Dense Subgraph Problems
    Komusiewicz, C., Sorge, M. Discrete Applied Mathematics. 193, 145–161 (2015).
    (pdf) (orig)

    (bib)

    @article{KS15j,
      title = {An Algorithmic Framework for Fixed-Cardinality
                        Optimization in Sparse Graphs Applied to Dense
                        Subgraph Problems},
      author = {Komusiewicz, Christian and Sorge, Manuel},
      journal = {Discrete Applied Mathematics},
      year = {2015},
      publisher = {Elsevier},
      url = {https://fpt.akt.tu-berlin.de/publications/mu-clique-theory-long-web.pdf},
      url2 = {http://dx.doi.org/10.1016/j.dam.2015.04.029},
      volume = {193},
      pages = {145--161}
    }
    

    
    
45. The Minimum Feasible Tileset problem
    Disser, Y., Kratsch, S., Sorge, M. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA ’14). pp. 144–155. Springer (2014).
    (pdf) (orig)

    (bib)

    @inproceedings{DKS14,
      author = {Disser, Yann and Kratsch, Stefan and Sorge, Manuel},
      title = {The Minimum Feasible Tileset problem},
      booktitle = {Proceedings of the 12th Workshop on Approximation
                        and Online Algorithms (WAOA '14)},
      year = {2014},
      pages = {144--155},
      volume = {8952},
      series = {LNCS},
      publisher = {Springer},
      url = {http://arxiv.org/abs/1409.8524},
      url2 = {http://dx.doi.org/10.1007/978-3-319-18263-6_13}
    }
    

    
    
46. On the Parameterized Complexity of Computing Balanced Partitions in Graphs
    Bevern, R. van, Feldmann, A.E., Sorge, M., Suchý, O. Theory of Computing Systems. 57, 1–35 (2014).
    (pdf) (orig)

    (bib)

    @article{BFSS15j,
      author = {van Bevern, Ren\'e and Feldmann, Andreas Emil and Sorge, Manuel and Such\'y, Ondrej},
      title = {On the Parameterized Complexity of Computing
                        Balanced Partitions in Graphs},
      journal = {Theory of Computing Systems},
      year = {2014},
      publisher = {Springer},
      doi = {10.1007/s00224-014-9557-5},
      url = {http://fpt.akt.tu-berlin.de/publications/On_the_Parameterized_Complexity_of_Computing_Balanced_Partitions_in_Graphs-TOCS.pdf},
      url2 = {http://dx.doi.org/10.1007/s00224-014-9557-5},
      volume = {57},
      issue = {1},
      pages = {1--35}
    }
    

    
    
47. Constant-factor approximations for Capacitated Arc Routing without triangle inequality
    Bevern, R. van, Hartung, S., Nichterlein, A., Sorge, M. Operations Research Letters. 4, 290–292 (2014).
    (pdf) (orig)

    (bib)

    @article{BHNS14j,
      title = {Constant-factor approximations for {Capacitated Arc
                        Routing} without triangle inequality},
      journal = {Operations Research Letters},
      volume = {4},
      number = {4},
      pages = {290--292},
      year = {2014},
      doi = {10.1016/j.orl.2014.05.002},
      url2 = {http://dx.doi.org/10.1016/j.orl.2014.05.002},
      url = {http://arxiv.org/abs/1404.3660},
      author = {van Bevern, Ren\'e and Hartung, Sepp and Nichterlein, Andr\'e and Sorge, Manuel}
    }
    

    
    
48. Exploiting a Hypergraph Model for Finding Golomb Rulers
    Sorge, M., Moser, H., Niedermeier, R., Weller, M. Acta Informatica. 51, 449–471 (2014).
    (pdf) (orig)

    (bib)

    @article{SMNW14j,
      author = {Sorge, Manuel and Moser, Hannes and Niedermeier, Rolf and Weller, Mathias},
      title = {Exploiting a Hypergraph Model for Finding Golomb
                        Rulers},
      journal = {Acta Informatica},
      year = {2014},
      publisher = {Springer},
      doi = {10.1007/s00236-014-0202-1},
      url = {http://fpt.akt.tu-berlin.de/publications/Exploiting_a_Hypergraph_Model_for_Finding_Golomb_Rulers-AI.pdf},
      volume = {51},
      issue = {7},
      pages = {449--471},
      url2 = {http://dx.doi.org/10.1007/s00236-014-0202-1}
    }
    

    
    
49. On the Parameterized Complexity of Computing Graph Bisections
    Bevern, R. van, Feldmann, A.E., Sorge, M., Suchý, O. In: Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG ’13). pp. 76–88. Springer (2013).
    (pdf) (orig)

    (bib)

    @inproceedings{BFSS13,
      author = {van Bevern, Ren\'e and Feldmann, Andreas Emil and Sorge, Manuel and Such{\'y}, Ondrej},
      title = {On the Parameterized Complexity of Computing Graph
                        Bisections},
      booktitle = {Proceedings of the 39th International Workshop on
                        Graph-Theoretic Concepts in Computer Science (WG
                        '13)},
      series = {LNCS},
      pages = {76--88},
      volume = {8165},
      year = {2013},
      publisher = {Springer},
      url = {http://fpt.akt.tu-berlin.de/publications/bisection-wg.pdf},
      url2 = {http://link.springer.com/chapter/10.1007%2F978-3-642-45043-3_8}
    }
    

    
    
50. Effective and Efficient Data Reduction for the Subset Interconnection Design Problem
    Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Suchý, O., Weller, M. In: Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC ’13). pp. 361–371 (2013).
    (pdf) (orig)

    (bib)

    @inproceedings{CKNSSW13,
      author = {Chen, Jiehua and Komusiewicz, Christian and Niedermeier, Rolf and Sorge, Manuel and Such{\'y}, Ondrej and Weller, Mathias},
      title = {Effective and Efficient Data Reduction for the
                        Subset Interconnection Design Problem},
      booktitle = {Proceedings of the 24th International Symposium on
                        Algorithms and Computation (ISAAC '13)},
      year = {2013},
      url = {http://fpt.akt.tu-berlin.de/publications/subset-interconnection-design.pdf},
      url2 = {http://link.springer.com/chapter/10.1007%2F978-3-642-45030-3_34},
      pages = {361--371},
      series = {LNCS},
      volume = {8283}
    }
    

    
    
51. A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems
    Froese, V., Bevern, R. van, Niedermeier, R., Sorge, M. In: Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS ’13). pp. 445–456. Springer (2013).
    (pdf) (orig)

    (bib)

    @inproceedings{FBNS13,
      author = {Froese, Vincent and van Bevern, Ren\'e and Niedermeier, Rolf and Sorge, Manuel},
      title = {A Parameterized Complexity Analysis of Combinatorial
                        Feature Selection Problems},
      booktitle = {Proceedings of the 38th International Symposium on
                        Mathematical Foundations of Computer Science (MFCS
                        '13)},
      series = {LNCS},
      pages = {445--456},
      volume = {8087},
      year = {2013},
      publisher = {Springer},
      url = {http://fpt.akt.tu-berlin.de/publications/featsel-mfcs13.pdf},
      url2 = {http://dx.doi.org/10.1007/978-3-642-40313-2_40}
    }
    

    
    
52. Exploiting a Hypergraph Model for Finding Golomb Rulers
    Sorge, M., Moser, H., Niedermeier, R., Weller, M. In: Proceedings of the 2nd International Symposium on Combinatorial Optimization (ISCO ’12). pp. 368–379. Springer (2012).
    (pdf) (orig)

    (bib)

    @inproceedings{SMNW12,
      author = {Sorge, Manuel and Moser, Hannes and Niedermeier, Rolf and Weller, Mathias},
      title = {Exploiting a Hypergraph Model for Finding Golomb
                        Rulers},
      booktitle = {Proceedings of the 2nd International Symposium on
                        Combinatorial Optimization (ISCO '12)},
      year = {2012},
      pages = {368--379},
      volume = {7422},
      doi = {10.1007/978-3-642-32147-4_33},
      series = {LNCS},
      publisher = {Springer},
      url = {http://fpt.akt.tu-berlin.de/publications/Exploiting_a_Hypergraph_Model_for_Finding_Golomb_Rulers-ISCO.pdf},
      url2 = {http://dx.doi.org/10.1007/978-3-642-32147-4_33}
    }
    

    
    
53. Finding Dense Subgraphs of Sparse Graphs
    Komusiewicz, C., Sorge, M. In: Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC ’12). pp. 242–251. Springer (2012).
    (pdf) (orig)

    (bib)

    @inproceedings{KS12,
      author = {Komusiewicz, Christian and Sorge, Manuel},
      title = {Finding Dense Subgraphs of Sparse Graphs},
      booktitle = {Proceedings of the 7th International Symposium on
                        Parameterized and Exact Computation (IPEC '12)},
      publisher = {Springer},
      year = {2012},
      pages = {242--251},
      volume = {7535},
      series = {LNCS},
      url = {http://fpt.akt.tu-berlin.de/publications/Finding_Dense_Subgraphs_of_Sparse_Graphs-IPEC2012.pdf},
      url2 = {http://dx.doi.org/10.1007/978-3-642-33293-7_23}
    }
    

    
    
54. Exact combinatorial algorithms and experiments for finding maximum k-plexes
    Moser, H., Niedermeier, R., Sorge, M. Journal of Combinatorial Optimization. 24, 347–373 (2012).
    (pdf) (orig)

    (bib)

    @article{MNS12j,
      author = {Moser, Hannes and Niedermeier, Rolf and Sorge, Manuel},
      title = {Exact combinatorial algorithms and experiments for
                        finding maximum $k$-plexes},
      journal = {Journal of Combinatorial Optimization},
      year = {2012},
      pages = {347--373},
      volume = {24},
      issue = {3},
      doi = {10.1007/s10878-011-9391-5},
      publisher = {Springer},
      url = {http://fpt.akt.tu-berlin.de/publications/combinatorial-algorithms-experiments-for-maximum-kplex.pdf},
      url2 = {http://dx.doi.org/10.1007/s10878-011-9391-5}
    }
    

    
    
55. A New View on Rural Postman Based on Eulerian Extension and Matching
    Sorge, M., Bevern, R. van, Niedermeier, R., Weller, M. Journal of Discrete Algorithms. 16, 12–33 (2012).
    (pdf) (orig)

    (bib)

    @article{SBNW12j,
      author = {Sorge, Manuel and van Bevern, Ren\'e and Niedermeier, Rolf and Weller, Mathias},
      title = {A New View on {Rural Postman} Based on {Eulerian
                        Extension} and {Matching}},
      journal = {Journal of Discrete Algorithms},
      volume = {16},
      pages = {12--33},
      year = {2012},
      publisher = {Elsevier},
      doi = {10.1016/j.jda.2012.04.007},
      url = {http://fpt.akt.tu-berlin.de/publications/A_New_View_on_Rural_Postman_Based_on_Eulerian_Extension_and_Matching-JDA.pdf},
      url2 = {http://dx.doi.org/10.1016/j.jda.2012.04.007}
    }
    

    
    
56. A New View on Rural Postman Based on Eulerian Extension and Matching
    Sorge, M., Bevern, R. van, Niedermeier, R., Weller, M. In: Proceedings of the 22nd International Workshop on Combinatorial Algorithms (IWOCA ’11). pp. 310–323. Springer (2011).
    (pdf) (orig)

    (bib)

    @inproceedings{SvBNW11a,
      author = {Sorge, Manuel and van Bevern, Ren{\'e} and Niedermeier, Rolf and Weller, Mathias},
      title = {A New View on {Rural Postman} Based on {Eulerian
                        Extension} and {Matching}},
      booktitle = {Proceedings of the 22nd International Workshop on
                        Combinatorial Algorithms (IWOCA '11)},
      year = {2011},
      volume = {7056},
      pages = {310--323},
      series = {LNCS},
      publisher = {Springer},
      url = {http://fpt.akt.tu-berlin.de/publications/A_New_View_on_Rural_Postman_Based_on_Eulerian_Extension_and_Matching-IWOCA.pdf},
      url2 = {http://dx.doi.org/10.1007/978-3-642-25011-8_25}
    }
    

    
    
57. From Few Components to an Eulerian Graph by Adding Arcs
    Sorge, M., Bevern, R. van, Niedermeier, R., Weller, M. In: Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG ’11). pp. 307–318. Springer (2011).
    (pdf) (orig)

    (bib)

    @inproceedings{SvBNW11,
      author = {Sorge, Manuel and van Bevern, Ren{\'e} and Niedermeier, Rolf and Weller, Mathias},
      title = {From Few Components to an Eulerian Graph by Adding
                        Arcs},
      booktitle = {Proceedings of the 37th International Workshop on
                        Graph-Theoretic Concepts in Computer Science (WG
                        '11)},
      year = {2011},
      volume = {6986},
      pages = {307--318},
      series = {LNCS},
      publisher = {Springer},
      url = {http://fpt.akt.tu-berlin.de/publications/From_Few_Components_to_an_Eulerian_Graph_by_Adding_Arcs-WG.pdf},
      url2 = {http://dx.doi.org/10.1007/978-3-642-25870-1_28}
    }
    

    
    
58. Algorithms and Experiments for Clique Relaxations—Finding Maximum s-Plexes
    Moser, H., Niedermeier, R., Sorge, M. In: Proceedings of the 8th International Symposium on Experimental Algorithms (SEA ’09). pp. 233–244. Springer (2009).
    (pdf) (orig)

    (bib)

    @inproceedings{MNS09,
      author = {Moser, Hannes and Niedermeier, Rolf and Sorge, Manuel},
      title = {Algorithms and Experiments for Clique
                        Relaxations---Finding Maximum $s$-Plexes},
      booktitle = {Proceedings of the 8th International Symposium on
                        Experimental Algorithms (SEA '09)},
      year = {2009},
      volume = {5526},
      series = {LNCS},
      pages = {233--244},
      publisher = {Springer},
      doi = {10.1007/978-3-642-02011-7_22},
      url = {http://www.akt.tu-berlin.de/fileadmin/fg34/publications-akt/max-splex_sea2009_stamped.pdf},
      url2 = {http://dx.doi.org/10.1007/978-3-642-02011-7_22}
    }
    

    
    

Theses

1. Be Sparse! Be Dense! Be Robust! Elements of Parameterized Algorithmics
   Sorge, M. Doktorarbeit, Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Germany. (2017).
   (pdf)

   (bib)

   @phdthesis{Sor17,
     title = {Be Sparse! Be Dense! Be Robust! Elements of
                       Parameterized Algorithmics},
     author = {Sorge, Manuel},
     type = {Doktorarbeit},
     school = {Institut für Softwaretechnik und Theoretische
                       Informatik, Technische Universität Berlin, Germany},
     year = {2017},
     _note = {Doktorarbeit, Institut für Softwaretechnik und
                       Theoretische Informatik, Technische Universität
                       Berlin, Germany},
     url = {http://dx.doi.org/10.14279/depositonce-5635}
   }
   

   
   
2. On Making Directed Graphs Eulerian
   Sorge, M. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany. (2011).
   (pdf)

   (bib)

   @mastersthesis{Sor11,
     title = {On Making Directed Graphs Eulerian},
     author = {Sorge, Manuel},
     type = {Diplomarbeit},
     school = {Institut für Informatik,
                       Friedrich-Schiller-Universität Jena, Germany},
     year = {2011},
     _note = {Diplomarbeit, Institut für Informatik,
                       Friedrich-Schiller-Universität Jena, Germany},
     url = {http://arxiv.org/abs/1101.4283}
   }
   

   
   
3. Algorithmic Aspects of Golomb Ruler Construction
   Sorge, M. Studienarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany. (2010).
   (pdf)

   (bib)

   @mastersthesis{Sor10,
     title = {Algorithmic Aspects of Golomb Ruler Construction},
     author = {Sorge, Manuel},
     type = {Studienarbeit},
     school = {Institut für Informatik,
                       Friedrich-Schiller-Universität Jena, Germany},
     year = {2010},
     _note = {Studienarbeit, Institut für Informatik,
                       Friedrich-Schiller-Universität Jena, Germany},
     url = {http://arxiv.org/abs/1005.5395}
   }