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. SIAM (2014).
   (pdf) (orig)

   (bib)

   @incollection{BNSW14,
     title = {Complexity of Arc Routing Problems},
     author = {van Bevern, Ren{\'e} 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/}
   }
   

   
   

Journal and conference articles

1. The influence of dimensions on the complexity of computing decision trees
   Kobourov, S.G., Löffler, M., Montecchiani, F., Pilipczuk, M., Rutter, I., Seidel, R., Sorge, M., Wulms, J. Artificial Intelligence. 343, 104322 (2025).
   (pdf) (orig)

   (bib)

   @article{DBLP:journals/ai/KobourovLMPRSSW25,
     author = {Kobourov, Stephen G. and L{\"{o}}ffler, Maarten and Montecchiani, Fabrizio and Pilipczuk, Marcin and Rutter, Ignaz and Seidel, Raimund and Sorge, Manuel and Wulms, Jules},
     title = {The influence of dimensions on the complexity of computing decision
                       trees},
     journal = {Artificial Intelligence},
     volume = {343},
     pages = {104322},
     year = {2025},
     url = {https://doi.org/10.48550/arXiv.2205.07756},
     doi = {10.1016/J.ARTINT.2025.104322},
     url2 = {https://doi.org/10.1016/j.artint.2025.104322}
   }
   

   
   
2. The complexity of cluster vertex splitting and company
   Firbas, A., Dobler, A., Holzer, F., Schafellner, J., Sorge, M., Villedieu Anaı̈s, Wißmann, M. Discrete Applied Mathematics. 365, 190–207 (2025).
   (pdf) (orig)

   (bib)

   @article{DBLP:journals/dam/FirbasDHSSVW25,
     author = {Firbas, Alexander and Dobler, Alexander and Holzer, Fabian and Schafellner, Jakob and Sorge, Manuel and Villedieu, Ana{\"{\i}}s and Wi{\ss}mann, Monika},
     title = {The complexity of cluster vertex splitting and company},
     journal = {Discrete Applied Mathematics},
     volume = {365},
     pages = {190--207},
     year = {2025},
     url = {https://doi.org/10.48550/arXiv.2309.00504},
     doi = {10.1016/J.DAM.2025.01.012},
     url2 = {https://doi.org/10.1016/j.dam.2025.01.012}
   }
   

   
   
3. Planarizing graphs and their drawings by vertex splitting
   Nöllenburg, M., Sorge, M., Terziadis, S., Villedieu Anaı̈s, Wu, H.-Y., Wulms, J. Journal of Computational Geometry. 16, 333–372 (2025).
   (pdf) (orig)

   (bib)

   @article{DBLP:journals/jocg/NollenburgSTVWW25,
     author = {N{\"{o}}llenburg, Martin and Sorge, Manuel and Terziadis, Soeren and Villedieu, Ana{\"{\i}}s and Wu, Hsiang{-}Yun and Wulms, Jules},
     title = {Planarizing graphs and their drawings by vertex splitting},
     journal = {Journal of Computational Geometry},
     volume = {16},
     number = {1},
     pages = {333--372},
     year = {2025},
     url = {https://arxiv.org/abs/2202.12293},
     doi = {10.20382/JOCG.V16I1A10},
     url2 = {https://doi.org/10.20382/jocg.v16i1a10}
   }
   

   
   
4. Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
   Staus, L.P., Komusiewicz, C., Sommer, F., Sorge, M. In: Proceedings of the 2025 AAAI Conference on Artificial Intelligence (AAAI 2025). AAAI Press (2025).
   (pdf) (orig)

   (bib)

   @inproceedings{DBLP:conf/aaai/StausKSS25,
     author = {Staus, Luca Pascal and Komusiewicz, Christian and Sommer, Frank and Sorge, Manuel},
     title = {Witty: An Efficient Solver for Computing Minimum-Size Decision Trees},
     booktitle = {Proceedings of the 2025 AAAI Conference on Artificial Intelligence (AAAI 2025)},
     pages = {20584--20591},
     publisher = {{AAAI} Press},
     year = {2025},
     url = {https://doi.org/10.48550/arXiv.2412.11954},
     url2 = {https://doi.org/10.1609/aaai.v39i19.34268},
     doi = {10.1609/AAAI.V39I19.34268}
   }
   

   
   
5. Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
   Harviainen, J., Sommer, F., Sorge, M., Szeider, S. In: Proceedings of the 2025 International Conference on Machine Learning (ICML 2025). PMLR / OpenReview.net (2025).
   (pdf) (orig)

   (bib)

   @inproceedings{DBLP:conf/icml/HarviainenSSS25,
     author = {Harviainen, Juha and Sommer, Frank and Sorge, Manuel and Szeider, Stefan},
     title = {Optimal Decision Tree Pruning Revisited: Algorithms and Complexity},
     booktitle = {Proceedings of the 2025 International Conference on Machine Learning (ICML 2025)},
     series = {Proceedings of Machine Learning Research},
     volume = {267},
     publisher = {{PMLR} / OpenReview.net},
     year = {2025},
     url = {https://doi.org/10.48550/arXiv.2503.03576},
     url2 = {https://proceedings.mlr.press/v267/harviainen25a.html}
   }
   

   
   
6. Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms
   Komusiewicz, C., Schidler, A., Sommer, F., Sorge, M., Staus, L.P. In: Proceedings of the 2025 International Conference on Machine Learning (ICML 2025). PMLR / OpenReview.net (2025).
   (pdf)

   (bib)

   @inproceedings{DBLP:conf/icml/KomusiewiczSSSS25,
     author = {Komusiewicz, Christian and Schidler, Andr{\'{e}} and Sommer, Frank and Sorge, Manuel and Staus, Luca Pascal},
     title = {Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms},
     booktitle = {Proceedings of the 2025 International Conference on Machine Learning (ICML 2025)},
     series = {Proceedings of Machine Learning Research},
     volume = {267},
     publisher = {{PMLR} / OpenReview.net},
     year = {2025},
     url = {https://proceedings.mlr.press/v267/komusiewicz25a.html}
   }
   

   
   
7. The role of twins in computing planar supports of hypergraphs
   Bevern, R. van, Kanj, I., Komusiewicz, C., Niedermeier, R., Sorge, M. Journal of Graph Algorithms and Applications. 28, 51–79 (2024).
   (pdf)

   (bib)

   @article{DBLP:journals/jgaa/BevernKKNS24,
     author = {van Bevern, Ren{\'{e}} and Kanj, Iyad and Komusiewicz, Christian and Niedermeier, Rolf and Sorge, Manuel},
     title = {The role of twins in computing planar supports of hypergraphs},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {28},
     number = {1},
     pages = {51--79},
     year = {2024},
     url = {https://doi.org/10.7155/jgaa.v28i1.2927},
     doi = {10.7155/JGAA.V28I1.2927}
   }
   

   
   
8. Cluster Editing for Multi-Layer and Temporal Graphs
   Chen, J., Molter, H., Sorge, M., Suchý, O. Theory of Computing Systems. 68, 1239–1290 (2024).
   (pdf)

   (bib)

   @article{DBLP:journals/mst/ChenMSS24,
     author = {Chen, Jiehua and Molter, Hendrik and Sorge, Manuel and Such{\'{y}}, Ondrej},
     title = {Cluster Editing for Multi-Layer and Temporal Graphs},
     journal = {Theory of Computing Systems},
     volume = {68},
     number = {5},
     pages = {1239--1290},
     year = {2024},
     url = {https://doi.org/10.1007/s00224-024-10174-y},
     doi = {10.1007/S00224-024-10174-Y}
   }
   

   
   
9. A note on clustering aggregation for binary clusterings
   Chen, J., Hermelin, D., Sorge, M. Operations Research Letters. 52, 107052 (2024).
   (pdf)

   (bib)

   @article{DBLP:journals/orl/ChenHS24,
     author = {Chen, Jiehua and Hermelin, Danny and Sorge, Manuel},
     title = {A note on clustering aggregation for binary clusterings},
     journal = {Operations Research Letters},
     volume = {52},
     pages = {107052},
     year = {2024},
     url = {https://doi.org/10.1016/j.orl.2023.11.005},
     doi = {10.1016/J.ORL.2023.11.005}
   }
   

   
   
10. Cluster Editing Parameterized above Modification-disjoint P₃-packings
    Li, S., Pilipczuk, M., Sorge, M. ACM Transactions on Algorithms. 20, 3:1–3:43 (2024).
    (pdf)

    (bib)

    @article{DBLP:journals/talg/LiPS24,
      author = {Li, Shaohua and Pilipczuk, Marcin and Sorge, Manuel},
      title = {Cluster Editing Parameterized above Modification-disjoint P₃-packings},
      journal = {{ACM} Transactions on Algorithms},
      volume = {20},
      number = {1},
      pages = {3:1--3:43},
      year = {2024},
      url = {https://doi.org/10.1145/3626526},
      doi = {10.1145/3626526}
    }
    

    
    
11. On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
    Firbas, A., Sorge, M. In: Proceedings of the 2024 International Symposium on Algorithms and Computation (ISAAC 2024). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2024).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/isaac/FirbasS24,
      author = {Firbas, Alexander and Sorge, Manuel},
      title = {On the Complexity of Establishing Hereditary Graph Properties via
                        Vertex Splitting},
      booktitle = {Proceedings of the 2024 International Symposium on Algorithms and Computation (ISAAC 2024)},
      series = {LIPIcs},
      volume = {322},
      pages = {30:1--30:15},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2024},
      url = {https://doi.org/10.48550/arXiv.2401.16296},
      url2 = {https://doi.org/10.4230/LIPIcs.ISAAC.2024.30},
      doi = {10.4230/LIPICS.ISAAC.2024.30}
    }
    

    
    
12. The Complexity of Cluster Vertex Splitting and Company
    Firbas, A., Dobler, A., Holzer, F., Schafellner, J., Sorge, M., Villedieu Anaı̈s, Wißmann, M. In: Proceedings of the 2024 International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024). Springer (2024).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/sofsem/FirbasDHSSVW24,
      author = {Firbas, Alexander and Dobler, Alexander and Holzer, Fabian and Schafellner, Jakob and Sorge, Manuel and Villedieu, Ana{\"{\i}}s and Wi{\ss}mann, Monika},
      title = {The Complexity of Cluster Vertex Splitting and Company},
      booktitle = {Proceedings of the 2024 International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024)},
      series = {Lecture Notes in Computer Science},
      volume = {14519},
      pages = {226--239},
      publisher = {Springer},
      year = {2024},
      url = {https://doi.org/10.1007/978-3-031-52113-3\_16},
      doi = {10.1007/978-3-031-52113-3\_16}
    }
    

    
    
13. The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
    Bellitto, T., Li, S., Okrasa, K., Pilipczuk, M., Sorge, M. Algorithmica. 85, 1202–1250 (2023).
    (pdf)

    (bib)

    @article{DBLP:journals/algorithmica/BellittoLOPS23,
      author = {Bellitto, Thomas and Li, Shaohua and Okrasa, Karolina and Pilipczuk, Marcin and Sorge, Manuel},
      title = {The Complexity of Routing Problems in Forbidden-Transition Graphs
                        and Edge-Colored Graphs},
      journal = {Algorithmica},
      volume = {85},
      number = {5},
      pages = {1202--1250},
      year = {2023},
      url = {https://doi.org/10.1007/s00453-022-01064-1},
      doi = {10.1007/S00453-022-01064-1}
    }
    

    
    
14. Game Implementation: What Are the Obstructions?
    Chen, J., Khavidaki, S.N.L., Haydn, S.V., Simola, S., Sorge, M. In: Proceedings of the 2023 AAAI Conference on Artificial Intelligence (AAAI 2023). AAAI Press (2023).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/aaai/0001KHSS23,
      author = {Chen, Jiehua and Khavidaki, Seyedeh Negar Layegh and Haydn, Sebastian Vincent and Simola, Sofia and Sorge, Manuel},
      title = {Game Implementation: What Are the Obstructions?},
      booktitle = {Proceedings of the 2023 AAAI Conference on Artificial Intelligence (AAAI 2023)},
      pages = {5557--5564},
      publisher = {{AAAI} Press},
      year = {2023},
      url = {https://doi.org/10.48550/arXiv.2212.00699},
      url2 = {https://doi.org/10.1609/aaai.v37i5.25690},
      doi = {10.1609/AAAI.V37I5.25690}
    }
    

    
    
15. The Influence of Dimensions on the Complexity of Computing Decision Trees
    Kobourov, S.G., Löffler, M., Montecchiani, F., Pilipczuk, M., Rutter, I., Seidel, R., Sorge, M., Wulms, J. In: Proceedings of the 2023 AAAI Conference on Artificial Intelligence (AAAI 2023). AAAI Press (2023).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/aaai/KobourovLMPRSSW23,
      author = {Kobourov, Stephen G. and L{\"{o}}ffler, Maarten and Montecchiani, Fabrizio and Pilipczuk, Marcin and Rutter, Ignaz and Seidel, Raimund and Sorge, Manuel and Wulms, Jules},
      title = {The Influence of Dimensions on the Complexity of Computing Decision
                        Trees},
      booktitle = {Proceedings of the 2023 AAAI Conference on Artificial Intelligence (AAAI 2023)},
      pages = {8343--8350},
      publisher = {{AAAI} Press},
      year = {2023},
      url = {https://doi.org/10.1609/aaai.v37i7.26006},
      doi = {10.1609/AAAI.V37I7.26006}
    }
    

    
    
16. On Computing Optimal Tree Ensembles
    Komusiewicz, C., Kunz, P., Sommer, F., Sorge, M. In: Proceedings of the 2023 International Conference on Machine Learning (ICML 2023). PMLR (2023).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/icml/KomusiewiczKSS23,
      author = {Komusiewicz, Christian and Kunz, Pascal and Sommer, Frank and Sorge, Manuel},
      title = {On Computing Optimal Tree Ensembles},
      booktitle = {Proceedings of the 2023 International Conference on Machine Learning (ICML 2023)},
      series = {Proceedings of Machine Learning Research},
      volume = {202},
      pages = {17364--17374},
      publisher = {{PMLR}},
      year = {2023},
      url = {https://doi.org/10.48550/arXiv.2306.04423},
      url2 = {https://proceedings.mlr.press/v202/komusiewicz23a.html}
    }
    

    
    
17. Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
    Hatzel, M., Jaffke, L., Lima, P.T., Masarı́k Tomás, Pilipczuk, M., Sharma, R., Sorge, M. In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA 2023). SIAM (2023).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/soda/HatzelJLMPSS23,
      author = {Hatzel, Meike and Jaffke, Lars and Lima, Paloma T. and Masar{\'{\i}}k, Tom{\'{a}}s and Pilipczuk, Marcin and Sharma, Roohani and Sorge, Manuel},
      title = {Fixed-parameter tractability of {DIRECTED} {MULTICUT} with three terminal
                        pairs parameterized by the size of the cutset: twin-width meets flow-augmentation},
      booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)},
      pages = {3229--3244},
      publisher = {{SIAM}},
      year = {2023},
      url = {https://doi.org/10.48550/arXiv.2207.07425},
      url2 = {https://doi.org/10.1137/1.9781611977554.ch123},
      doi = {10.1137/1.9781611977554.CH123}
    }
    

    
    
18. Packing Directed Cycles Quarter- and Half-Integrally
    Masarı́k Tomás, Muzi, I., Pilipczuk, M., Rzazewski, P., Sorge, M. Combinatorica. 42, 1409–1438 (2022).
    (pdf)

    (bib)

    @article{DBLP:journals/combinatorica/MasarikMPRS22,
      author = {Masar{\'{\i}}k, Tom{\'{a}}s and Muzi, Irene and Pilipczuk, Marcin and Rzazewski, Pawel and Sorge, Manuel},
      title = {Packing Directed Cycles Quarter- and Half-Integrally},
      journal = {Combinatorica},
      volume = {42},
      number = {Supplement 2},
      pages = {1409--1438},
      year = {2022},
      url = {https://doi.org/10.1007/s00493-021-4743-y},
      doi = {10.1007/S00493-021-4743-Y}
    }
    

    
    
19. Constant Congestion Brambles
    Hatzel, M., Komosa, P., Pilipczuk, M., Sorge, M. Discrete Mathematics and Theoretical Computer Science. 24, (2022).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/dmtcs/HatzelKPS22,
      author = {Hatzel, Meike and Komosa, Pawel and Pilipczuk, Marcin and Sorge, Manuel},
      title = {Constant Congestion Brambles},
      journal = {Discrete Mathematics and Theoretical Computer Science},
      volume = {24},
      number = {1},
      year = {2022},
      url = {https://arxiv.org/abs/2008.02133},
      doi = {10.46298/DMTCS.6699},
      url2 = {https://doi.org/10.46298/dmtcs.6699}
    }
    

    
    
20. Threshold Treewidth and Hypertree Width
    Ganian, R., Schidler, A., Sorge, M., Szeider, S. Journal of Artificial Intelligence Research. 74, 1687–1713 (2022).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/jair/GanianSSS22,
      author = {Ganian, Robert and Schidler, Andr{\'{e}} and Sorge, Manuel and Szeider, Stefan},
      title = {Threshold Treewidth and Hypertree Width},
      journal = {Journal of Artificial Intelligence Research},
      volume = {74},
      pages = {1687--1713},
      year = {2022},
      url = {https://doi.org/10.48550/arXiv.2210.07040},
      doi = {10.1613/JAIR.1.13661},
      url2 = {https://doi.org/10.1613/jair.1.13661}
    }
    

    
    
21. Constant Congestion Brambles in Directed Graphs
    Masarı́k Tomás, Pilipczuk, M., Rzazewski, P., Sorge, M. SIAM Journal on Discrete Mathematics. 36, 922–938 (2022).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/siamdm/MasarikPRS22,
      author = {Masar{\'{\i}}k, Tom{\'{a}}s and Pilipczuk, Marcin and Rzazewski, Pawel and Sorge, Manuel},
      title = {Constant Congestion Brambles in Directed Graphs},
      journal = {{SIAM} Journal on Discrete Mathematics},
      volume = {36},
      number = {2},
      pages = {922--938},
      year = {2022},
      url = {https://arxiv.org/abs/2103.08445},
      doi = {10.1137/21M1417661},
      url2 = {https://doi.org/10.1137/21m1417661}
    }
    

    
    
22. Turbocharging Heuristics for Weak Coloring Numbers
    Dobler, A., Sorge, M., Villedieu Anaı̈s. In: Proceedings of the 2022 European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/esa/DoblerSV22,
      author = {Dobler, Alexander and Sorge, Manuel and Villedieu, Ana{\"{\i}}s},
      title = {Turbocharging Heuristics for Weak Coloring Numbers},
      booktitle = {Proceedings of the 2022 European Symposium on Algorithms (ESA 2022)},
      series = {LIPIcs},
      volume = {244},
      pages = {44:1--44:18},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2022},
      url = {https://doi.org/10.48550/arXiv.2203.03358},
      url2 = {https://doi.org/10.4230/LIPIcs.ESA.2022.44},
      doi = {10.4230/LIPICS.ESA.2022.44}
    }
    

    
    
23. Planarizing Graphs and Their Drawings by Vertex Splitting
    Nöllenburg, M., Sorge, M., Terziadis, S., Villedieu Anaı̈s, Wu, H.-Y., Wulms, J. In: Proceedings of the 2022 International Symposium on Graph Drawing and Network Visualization (GD 2022). Springer (2022).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/gd/NollenburgSTVWW22,
      author = {N{\"{o}}llenburg, Martin and Sorge, Manuel and Terziadis, Soeren and Villedieu, Ana{\"{\i}}s and Wu, Hsiang{-}Yun and Wulms, Jules},
      title = {Planarizing Graphs and Their Drawings by Vertex Splitting},
      booktitle = {Proceedings of the 2022 International Symposium on Graph Drawing and Network Visualization (GD 2022)},
      series = {Lecture Notes in Computer Science},
      volume = {13764},
      pages = {232--246},
      publisher = {Springer},
      year = {2022},
      url = {https://doi.org/10.1007/978-3-031-22203-0\_17},
      doi = {10.1007/978-3-031-22203-0\_17}
    }
    

    
    
24. Your rugby mates don’t need to know your colleagues: Triadic closure with edge colors
    Bulteau, L., Grüttemeier, N., Komusiewicz, C., Sorge, M. Journal of Computer and System Sciences. 120, 75–96 (2021).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/jcss/BulteauGKS21,
      author = {Bulteau, Laurent and Gr{\"{u}}ttemeier, Niels and Komusiewicz, Christian and Sorge, Manuel},
      title = {Your rugby mates don't need to know your colleagues: Triadic closure
                        with edge colors},
      journal = {Journal of Computer and System Sciences},
      volume = {120},
      pages = {75--96},
      year = {2021},
      url = {http://arxiv.org/abs/1811.09411},
      doi = {10.1016/J.JCSS.2021.03.001},
      url2 = {https://doi.org/10.1016/j.jcss.2021.03.001}
    }
    

    
    
25. Matchings under Preferences: Strength of Stability and Tradeoffs
    Chen, J., Skowron, P., Sorge, M. ACM Transactions on Economics and Computation. 9, 20:1–20:55 (2021).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/teco/ChenSS21,
      author = {Chen, Jiehua and Skowron, Piotr and Sorge, Manuel},
      title = {Matchings under Preferences: Strength of Stability and Tradeoffs},
      journal = {{ACM} Transactions on Economics and Computation},
      volume = {9},
      number = {4},
      pages = {20:1--20:55},
      year = {2021},
      url = {http://arxiv.org/abs/1902.10535},
      doi = {10.1145/3485000},
      url2 = {https://doi.org/10.1145/3485000}
    }
    

    
    
26. Fractional Matchings under Preferences: Stability and Optimality
    Chen, J., Roy, S., Sorge, M. In: Proceedings of the 2021 International Joint Conference on Artificial Intelligence (IJCAI 2021). ijcai.org (2021).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/ijcai/0001RS21,
      author = {Chen, Jiehua and Roy, Sanjukta and Sorge, Manuel},
      title = {Fractional Matchings under Preferences: Stability and Optimality},
      booktitle = {Proceedings of the 2021 International Joint Conference on Artificial Intelligence (IJCAI 2021)},
      pages = {89--95},
      publisher = {ijcai.org},
      year = {2021},
      url = {https://arxiv.org/abs/2011.12259},
      url2 = {https://doi.org/10.24963/ijcai.2021/13},
      doi = {10.24963/IJCAI.2021/13}
    }
    

    
    
27. On (Coalitional) Exchange-Stable Matching
    Chen, J., Chmurovic, A., Jogl, F., Sorge, M. In: Proceedings of the 2021 International Symposium on Algorithmic Game Theory (SAGT 2021). Springer (2021).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/sagt/ChenCJS21,
      author = {Chen, Jiehua and Chmurovic, Adrian and Jogl, Fabian and Sorge, Manuel},
      title = {On (Coalitional) Exchange-Stable Matching},
      booktitle = {Proceedings of the 2021 International Symposium on Algorithmic Game Theory (SAGT 2021)},
      series = {Lecture Notes in Computer Science},
      volume = {12885},
      pages = {205--220},
      publisher = {Springer},
      year = {2021},
      url = {https://arxiv.org/abs/2105.05725},
      url2 = {https://doi.org/10.1007/978-3-030-85947-3\_14},
      doi = {10.1007/978-3-030-85947-3\_14}
    }
    

    
    
28. 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 2021). SIAM (2021).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/soda/ChenCDFHNPPSWZ21,
      author = {Chen, Jiehua and Czerwinski, Wojciech and Disser, Yann and Feldmann, Andreas Emil and Hermelin, Danny and Nadara, Wojciech and Pilipczuk, Marcin and Pilipczuk, Michal 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 2021)},
      pages = {796--809},
      publisher = {{SIAM}},
      year = {2021},
      url = {https://doi.org/10.1137/1.9781611976465.50},
      doi = {10.1137/1.9781611976465.50}
    }
    

    
    
29. 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 2021). SIAM (2021).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/soda/KratschMMPS21,
      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 2021)},
      pages = {1702--1719},
      publisher = {{SIAM}},
      year = {2021},
      url = {https://arxiv.org/abs/2003.02475},
      url2 = {https://doi.org/10.1137/1.9781611976465.103},
      doi = {10.1137/1.9781611976465.103}
    }
    

    
    
30. Cluster Editing Parameterized Above Modification-Disjoint P\unicode8323-Packings
    Li, S., Pilipczuk, M., Sorge, M. In: Proceedings of the 2021 Symposium on Theoretical Aspects of Computer Science (STACS 2021). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/stacs/LiPS21,
      author = {Li, Shaohua and Pilipczuk, Marcin and Sorge, Manuel},
      title = {Cluster Editing Parameterized Above Modification-Disjoint P{\unicode{8323}}-Packings},
      booktitle = {Proceedings of the 2021 Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
      series = {LIPIcs},
      volume = {187},
      pages = {49:1--49:16},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2021},
      url = {https://doi.org/10.4230/LIPIcs.STACS.2021.49},
      doi = {10.4230/LIPICS.STACS.2021.49}
    }
    

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

    (bib)

    @article{DBLP:journals/dmtcs/PilipczukS20,
      author = {Pilipczuk, Marcin and Sorge, Manuel},
      title = {A Double Exponential Lower Bound for the Distinct Vectors Problem},
      journal = {Discrete Mathematics and Theoretical Computer Science},
      volume = {22},
      number = {4},
      year = {2020},
      url = {https://arxiv.org/abs/2002.01293},
      doi = {10.23638/DMTCS-22-4-7},
      url2 = {https://doi.org/10.23638/DMTCS-22-4-7}
    }
    

    
    
32. 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{DBLP:journals/jco/MillaniMNS20,
      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},
      volume = {39},
      number = {1},
      pages = {216--245},
      year = {2020},
      url = {http://arxiv.org/abs/1801.10401},
      doi = {10.1007/S10878-019-00464-4},
      url2 = {https://doi.org/10.1007/s10878-019-00464-4}
    }
    

    
    
33. h-Index manipulation by undoing merges
    Bevern, R. van, Komusiewicz, C., Molter, H., Niedermeier, R., Sorge, M., Walsh, T. Quantitative Science Studies. 1, 1529–1552 (2020).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/qss/BevernKMNSW20,
      author = {van Bevern, Ren{\'{e}} and Komusiewicz, Christian and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel and Walsh, Toby},
      title = {h-Index manipulation by undoing merges},
      journal = {Quantitative Science Studies},
      volume = {1},
      number = {4},
      pages = {1529--1552},
      year = {2020},
      url = {http://arxiv.org/abs/1604.04827},
      doi = {10.1162/QSS\_A\_00093},
      url2 = {https://doi.org/10.1162/qss\_a\_00093}
    }
    

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

    (bib)

    @article{DBLP:journals/siamdm/KanjKSL20,
      author = {Kanj, Iyad 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},
      volume = {34},
      number = {1},
      pages = {640--681},
      year = {2020},
      url = {http://arxiv.org/abs/1808.08772},
      doi = {10.1137/19M1239362},
      url2 = {https://doi.org/10.1137/19M1239362}
    }
    

    
    
35. Threshold Treewidth and Hypertree Width
    Ganian, R., Schidler, A., Sorge, M., Szeider, S. In: Proceedings of the 2020 International Joint Conference on Artificial Intelligence (IJCAI 2020). ijcai.org (2020).
    (pdf)

    (bib)

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

    
    
36. 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 2020 International Symposium on Algorithms and Computation (ISAAC 2020). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/isaac/BellittoLOPS20,
      author = {Bellitto, Thomas and Li, Shaohua and Okrasa, Karolina and Pilipczuk, Marcin and Sorge, Manuel},
      title = {The Complexity of Connectivity Problems in Forbidden-Transition Graphs
                        And Edge-Colored Graphs},
      booktitle = {Proceedings of the 2020 International Symposium on Algorithms and Computation (ISAAC 2020)},
      series = {LIPIcs},
      volume = {181},
      pages = {59:1--59:15},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2020},
      url = {https://arxiv.org/abs/2009.12892},
      url2 = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.59},
      doi = {10.4230/LIPICS.ISAAC.2020.59}
    }
    

    
    
37. The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth
    Kowalik, L., Mucha, M., Nadara, W., Pilipczuk, M., Sorge, M., Wygocki, P. In: Proceedings of the 2020 International Symposium on Parameterized and Exact Computation (IPEC 2020). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/iwpec/KowalikMNPSW20,
      author = {Kowalik, Lukasz and Mucha, Marcin and Nadara, Wojciech and Pilipczuk, Marcin and Sorge, Manuel and Wygocki, Piotr},
      title = {The {PACE} 2020 Parameterized Algorithms and Computational Experiments
                        Challenge: Treedepth},
      booktitle = {Proceedings of the 2020 International Symposium on Parameterized and Exact Computation (IPEC 2020)},
      series = {LIPIcs},
      volume = {180},
      pages = {37:1--37:18},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2020},
      url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.37},
      doi = {10.4230/LIPICS.IPEC.2020.37}
    }
    

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

    (bib)

    @article{DBLP:journals/algorithmica/DisserKS19,
      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},
      doi = {10.1007/S00453-018-0460-3},
      url2 = {https://doi.org/10.1007/s00453-018-0460-3}
    }
    

    
    
39. 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)

    (bib)

    @article{DBLP:journals/dam/Himmel0KFS19,
      author = {Himmel, Anne{-}Sophie and Hoffmann, Clemens and Kunz, Pascal and Froese, Vincent and Sorge, Manuel},
      title = {Computational complexity aspects of point visibility graphs},
      journal = {Discrete Applied Mathematics},
      volume = {254},
      pages = {283--290},
      year = {2019},
      url = {https://doi.org/10.1016/j.dam.2018.06.016},
      doi = {10.1016/J.DAM.2018.06.016}
    }
    

    
    
40. The complexity of routing with collision avoidance
    Fluschnik, T., Morik, M., Sorge, M. Journal of Computer and System Sciences. 102, 69–86 (2019).
    (pdf)

    (bib)

    @article{DBLP:journals/jcss/FluschnikMS19,
      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://doi.org/10.1016/j.jcss.2019.01.001},
      doi = {10.1016/J.JCSS.2019.01.001}
    }
    

    
    
41. 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–48 (2019).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/jcss/FluschnikKNS19,
      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--48},
      year = {2019},
      url = {http://arxiv.org/abs/1602.01739},
      doi = {10.1016/J.JCSS.2018.12.002},
      url2 = {https://doi.org/10.1016/j.jcss.2018.12.002}
    }
    

    
    
42. Assessing the computational complexity of multilayer subgraph detection
    Bredereck, R., Komusiewicz, C., Kratsch, S., Molter, H., Niedermeier, R., Sorge, M. Network Science. 7, 215–241 (2019).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/netsci/BredereckKKMNS19,
      author = {Bredereck, Robert and Komusiewicz, Christian and Kratsch, Stefan and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel},
      title = {Assessing the computational complexity of multilayer subgraph detection},
      journal = {Network Science},
      volume = {7},
      number = {2},
      pages = {215--241},
      year = {2019},
      url = {http://arxiv.org/abs/1604.07724},
      doi = {10.1017/NWS.2019.13},
      url2 = {https://doi.org/10.1017/nws.2019.13}
    }
    

    
    
43. 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 2019 International Conference on Algorithms and Complexity (CIAC 2019). Springer (2019).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/ciac/BulteauGKS19,
      author = {Bulteau, Laurent and Gr{\"{u}}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 2019 International Conference on Algorithms and Complexity (CIAC 2019)},
      series = {Lecture Notes in Computer Science},
      volume = {11485},
      pages = {99--111},
      publisher = {Springer},
      year = {2019},
      url = {https://doi.org/10.1007/978-3-030-17402-6\_9},
      doi = {10.1007/978-3-030-17402-6\_9}
    }
    

    
    
44. Matchings under Preferences: Strength of Stability and Trade-Offs
    Chen, J., Skowron, P., Sorge, M. In: Proceedings of the 2019 ACM Conference on Economics and Computation (EC 2019). ACM (2019).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/ec/ChenSS19,
      author = {Chen, Jiehua and Skowron, Piotr and Sorge, Manuel},
      title = {Matchings under Preferences: Strength of Stability and Trade-Offs},
      booktitle = {Proceedings of the 2019 ACM Conference on Economics and Computation (EC 2019)},
      pages = {41--59},
      publisher = {{ACM}},
      year = {2019},
      url = {https://doi.org/10.1145/3328526.3329555},
      doi = {10.1145/3328526.3329555}
    }
    

    
    
45. On Computing Centroids According to the p-Norms of Hamming Distance Vectors
    Chen, J., Hermelin, D., Sorge, M. In: Proceedings of the 2019 European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/esa/ChenHS19,
      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 2019 European Symposium on Algorithms (ESA 2019)},
      series = {LIPIcs},
      volume = {144},
      pages = {28:1--28:16},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2019},
      url = {http://arxiv.org/abs/1807.06469},
      url2 = {https://doi.org/10.4230/LIPIcs.ESA.2019.28},
      doi = {10.4230/LIPICS.ESA.2019.28}
    }
    

    
    
46. Packing Directed Circuits Quarter-Integrally
    Masarı́k Tomás, Muzi, I., Pilipczuk, M., Rzazewski, P., Sorge, M. In: Proceedings of the 2019 European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/esa/MasarikMPRS19,
      author = {Masar{\'{\i}}k, Tom{\'{a}}s and Muzi, Irene and Pilipczuk, Marcin and Rzazewski, Pawel and Sorge, Manuel},
      title = {Packing Directed Circuits Quarter-Integrally},
      booktitle = {Proceedings of the 2019 European Symposium on Algorithms (ESA 2019)},
      series = {LIPIcs},
      volume = {144},
      pages = {72:1--72:13},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2019},
      url = {http://arxiv.org/abs/1907.02494},
      url2 = {https://doi.org/10.4230/LIPIcs.ESA.2019.72},
      doi = {10.4230/LIPICS.ESA.2019.72}
    }
    

    
    
47. 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).
    (pdf)

    (bib)

    @article{DBLP:journals/candc/FertinHKS18,
      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},
      url = {https://doi.org/10.1016/j.compbiolchem.2018.03.015},
      doi = {10.1016/J.COMPBIOLCHEM.2018.03.015}
    }
    

    
    
48. 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)

    (bib)

    @article{DBLP:journals/disopt/BevernFMMSS18,
      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},
      volume = {30},
      pages = {20--50},
      year = {2018},
      url = {https://doi.org/10.1016/j.disopt.2018.05.002},
      doi = {10.1016/J.DISOPT.2018.05.002}
    }
    

    
    
49. 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{DBLP:journals/jcss/KanjKSL18,
      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 = {http://arxiv.org/abs/1702.04322},
      doi = {10.1016/J.JCSS.2017.08.002},
      url2 = {https://doi.org/10.1016/j.jcss.2017.08.002}
    }
    

    
    
50. 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 2018 European Symposium on Algorithms (ESA 2018). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/esa/KanjKSL18,
      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 2018 European Symposium on Algorithms (ESA 2018)},
      series = {LIPIcs},
      volume = {112},
      pages = {51:1--51:14},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2018},
      url = {https://doi.org/10.4230/LIPIcs.ESA.2018.51},
      doi = {10.4230/LIPICS.ESA.2018.51}
    }
    

    
    
51. How Hard Is It to Satisfy (Almost) All Roommates?
    Chen, J., Hermelin, D., Sorge, M., Yedidsion, H. In: Proceedings of the 2018 International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/icalp/ChenHSY18,
      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 2018 International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
      series = {LIPIcs},
      volume = {107},
      pages = {35:1--35:15},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2018},
      url = {http://arxiv.org/abs/1707.04316},
      url2 = {https://doi.org/10.4230/LIPIcs.ICALP.2018.35},
      doi = {10.4230/LIPICS.ICALP.2018.35}
    }
    

    
    
52. Cluster Editing in Multi-Layer and Temporal Graphs
    Chen, J., Molter, H., Sorge, M., Suchý, O. In: Proceedings of the 2018 International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/isaac/ChenMSS18,
      author = {Chen, Jiehua and Molter, Hendrik and Sorge, Manuel and Such{\'{y}}, Ondrej},
      title = {Cluster Editing in Multi-Layer and Temporal Graphs},
      booktitle = {Proceedings of the 2018 International Symposium on Algorithms and Computation (ISAAC 2018)},
      series = {LIPIcs},
      volume = {123},
      pages = {24:1--24:13},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2018},
      url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.24},
      doi = {10.4230/LIPICS.ISAAC.2018.24}
    }
    

    
    
53. Efficient Algorithms for Measuring the Funnel-Likeness of DAGs
    Millani, M.G., Molter, H., Niedermeier, R., Sorge, M. In: Proceedings of the 2018 International Symposium on Combinatorial Optimization (ISCO 2018). Springer (2018).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/iscopt/MillaniMNS18,
      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 2018 International Symposium on Combinatorial Optimization (ISCO 2018)},
      series = {Lecture Notes in Computer Science},
      volume = {10856},
      pages = {183--195},
      publisher = {Springer},
      year = {2018},
      url = {https://doi.org/10.1007/978-3-319-96151-4\_16},
      doi = {10.1007/978-3-319-96151-4\_16}
    }
    

    
    
54. The Parameterized Complexity of Centrality Improvement in Networks
    Hoffmann, C., Molter, H., Sorge, M. In: Proceedings of the 2018 International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018). Springer (2018).
    (pdf) (orig)

    (bib)

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

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

    (bib)

    @article{DBLP:journals/algorithmica/KratschS17,
      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},
      url = {http://arxiv.org/abs/1410.8819},
      doi = {10.1007/S00453-016-0231-Y},
      url2 = {https://doi.org/10.1007/s00453-016-0231-y}
    }
    

    
    
56. 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)

    (bib)

    @article{DBLP:journals/networks/BevernKS17,
      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://doi.org/10.1002/net.21742},
      doi = {10.1002/NET.21742}
    }
    

    
    
57. 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)

    (bib)

    @article{DBLP:journals/snam/HimmelMNS17,
      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://doi.org/10.1007/s13278-017-0455-0},
      doi = {10.1007/S13278-017-0455-0}
    }
    

    
    
58. 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 2017 International Conference on Algorithms and Complexity (CIAC 2017) (2017).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/ciac/BredereckKKMNS17,
      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 2017 International Conference on Algorithms and Complexity (CIAC 2017)},
      series = {Lecture Notes in Computer Science},
      volume = {10236},
      pages = {128--139},
      year = {2017},
      url = {https://doi.org/10.1007/978-3-319-57586-5\_12},
      doi = {10.1007/978-3-319-57586-5\_12}
    }
    

    
    
59. The Complexity of Routing with Few Collisions
    Fluschnik, T., Morik, M., Sorge, M. In: Proceedings of the 2017 International Symposium on Fundamentals of Computation Theory (FCT 2017). Springer (2017).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/fct/FluschnikMS17,
      author = {Fluschnik, Till and Morik, Marco and Sorge, Manuel},
      title = {The Complexity of Routing with Few Collisions},
      booktitle = {Proceedings of the 2017 International Symposium on Fundamentals of Computation Theory (FCT 2017)},
      series = {Lecture Notes in Computer Science},
      volume = {10472},
      pages = {257--270},
      publisher = {Springer},
      year = {2017},
      url = {http://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}
    }
    

    
    
60. 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)

    (bib)

    @article{DBLP:journals/ai/BevernKNSW16,
      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://doi.org/10.1016/j.artint.2016.08.001},
      doi = {10.1016/J.ARTINT.2016.08.001}
    }
    

    
    
61. 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{DBLP:journals/jcss/FroeseBNS16,
      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 = {http://arxiv.org/abs/1512.01150},
      doi = {10.1016/J.JCSS.2015.11.011},
      url2 = {https://doi.org/10.1016/j.jcss.2015.11.011}
    }
    

    
    
62. 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 2016). IEEE Computer Society (2016).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/asunam/HimmelMNS16,
      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 2016)},
      pages = {337--344},
      publisher = {{IEEE} Computer Society},
      year = {2016},
      url = {http://arxiv.org/abs/1605.03871},
      url2 = {https://doi.org/10.1109/ASONAM.2016.7752255},
      doi = {10.1109/ASONAM.2016.7752255}
    }
    

    
    
63. h-Index Manipulation by Undoing Merges
    Bevern, R. van, Komusiewicz, C., Molter, H., Niedermeier, R., Sorge, M., Walsh, T. In: Proceedings of the 2016 Prestigious Applications of Intelligent Systems (PAIS 2016). IOS Press (2016).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/ecai/BevernKMNSW16,
      author = {van Bevern, Ren{\'{e}} and Komusiewicz, Christian and Molter, Hendrik and Niedermeier, Rolf and Sorge, Manuel and Walsh, Toby},
      title = {h-Index Manipulation by Undoing Merges},
      booktitle = {Proceedings of the 2016 Prestigious Applications of Intelligent Systems (PAIS 2016)},
      series = {Frontiers in Artificial Intelligence and Applications},
      volume = {285},
      pages = {895--903},
      publisher = {{IOS} Press},
      year = {2016},
      url = {https://doi.org/10.3233/978-1-61499-672-9-895},
      doi = {10.3233/978-1-61499-672-9-895}
    }
    

    
    
64. Twins in Subdivision Drawings of Hypergraphs
    Bevern, R. van, Kanj, I.A., Komusiewicz, C., Niedermeier, R., Sorge, M. In: Proceedings of the 2016 International Symposium on Graph Drawing and Network Visualization (GD 2016). Springer (2016).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/gd/BevernKKNS16,
      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 2016 International Symposium on Graph Drawing and Network Visualization (GD 2016)},
      series = {Lecture Notes in Computer Science},
      volume = {9801},
      pages = {67--80},
      publisher = {Springer},
      year = {2016},
      url = {http://arxiv.org/abs/1511.09389},
      url2 = {https://doi.org/10.1007/978-3-319-50106-2\_6},
      doi = {10.1007/978-3-319-50106-2\_6}
    }
    

    
    
65. 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 2016 International Symposium on Parameterized and Exact Computation (IPEC 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/iwpec/BevernFMMSS16,
      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 2016 International Symposium on Parameterized and Exact Computation (IPEC 2016)},
      series = {LIPIcs},
      volume = {63},
      pages = {5:1--5:16},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2016},
      url = {http://arxiv.org/abs/1606.09000},
      url2 = {https://doi.org/10.4230/LIPIcs.IPEC.2016.5},
      doi = {10.4230/LIPICS.IPEC.2016.5}
    }
    

    
    
66. Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs
    Kanj, I.A., Komusiewicz, C., Sorge, M., Leeuwen, E.J. van. In: Proceedings of the 2016 Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/swat/KanjKSL16,
      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 2016 Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)},
      series = {LIPIcs},
      volume = {53},
      pages = {14:1--14:14},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2016},
      url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.14},
      doi = {10.4230/LIPICS.SWAT.2016.14}
    }
    

    
    
67. 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)

    (bib)

    @article{DBLP:journals/dam/KomusiewiczS15,
      author = {Komusiewicz, Christian and Sorge, Manuel},
      title = {An algorithmic framework for fixed-cardinality optimization in sparse
                        graphs applied to dense subgraph problems},
      journal = {Discrete Applied Mathematics},
      volume = {193},
      pages = {145--161},
      year = {2015},
      url = {https://doi.org/10.1016/j.dam.2015.04.029},
      doi = {10.1016/J.DAM.2015.04.029}
    }
    

    
    
68. 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 (2015).
    (pdf) (orig)

    (bib)

    @article{DBLP:journals/mst/BevernFSS15,
      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},
      volume = {57},
      number = {1},
      pages = {1--35},
      year = {2015},
      url = {http://arxiv.org/abs/1312.7014},
      doi = {10.1007/S00224-014-9557-5},
      url2 = {https://doi.org/10.1007/s00224-014-9557-5}
    }
    

    
    
69. 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)

    (bib)

    @article{DBLP:journals/siamdm/ChenKNSSW15,
      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},
      volume = {29},
      number = {1},
      pages = {1--25},
      year = {2015},
      url = {https://doi.org/10.1137/140955057},
      doi = {10.1137/140955057}
    }
    

    
    
70. Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
    Bevern, R. van, Komusiewicz, C., Sorge, M. In: Proceedings of the 2015 Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015).
    (pdf) (orig)

    (bib)

    @inproceedings{DBLP:conf/atmos/BevernKS15,
      author = {van Bevern, Ren{\'{e}} and Komusiewicz, Christian and Sorge, Manuel},
      title = {Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing
                        Problems},
      booktitle = {Proceedings of the 2015 Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
      series = {OASIcs},
      volume = {48},
      pages = {130--143},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2015},
      url = {http://arxiv.org/abs/1506.05620},
      url2 = {https://doi.org/10.4230/OASIcs.ATMOS.2015.130},
      doi = {10.4230/OASICS.ATMOS.2015.130}
    }
    

    
    
71. The Parameterized Complexity of the Minimum Shared Edges Problem
    Fluschnik, T., Kratsch, S., Niedermeier, R., Sorge, M. In: Proceedings of the 2015 IARCS Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/fsttcs/FluschnikKNS15,
      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 2015 IARCS Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
      series = {LIPIcs},
      volume = {45},
      pages = {448--462},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2015},
      url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.448},
      doi = {10.4230/LIPICS.FSTTCS.2015.448}
    }
    

    
    
72. 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 2015 International Joint Conference on Artificial Intelligence (IJCAI 2015). AAAI Press (2015).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/ijcai/BevernKNSW15,
      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},
      booktitle = {Proceedings of the 2015 International Joint Conference on Artificial Intelligence (IJCAI 2015)},
      pages = {808--814},
      publisher = {{AAAI} Press},
      year = {2015},
      url = {http://ijcai.org/Abstract/15/119}
    }
    

    
    
73. On Kernelization and Approximation for the Vector Connectivity Problem
    Kratsch, S., Sorge, M. In: Proceedings of the 2015 International Symposium on Parameterized and Exact Computation (IPEC 2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/iwpec/KratschS15,
      author = {Kratsch, Stefan and Sorge, Manuel},
      title = {On Kernelization and Approximation for the Vector Connectivity Problem},
      booktitle = {Proceedings of the 2015 International Symposium on Parameterized and Exact Computation (IPEC 2015)},
      series = {LIPIcs},
      volume = {43},
      pages = {377--388},
      publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
      year = {2015},
      url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.377},
      doi = {10.4230/LIPICS.IPEC.2015.377}
    }
    

    
    
74. Finding Highly Connected Subgraphs
    Hüffner, F., Komusiewicz, C., Sorge, M. In: Proceedings of the 2015 International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015). Springer (2015).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/sofsem/HuffnerKS15,
      author = {H{\"{u}}ffner, Falk and Komusiewicz, Christian and Sorge, Manuel},
      title = {Finding Highly Connected Subgraphs},
      booktitle = {Proceedings of the 2015 International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015)},
      series = {Lecture Notes in Computer Science},
      volume = {8939},
      pages = {254--265},
      publisher = {Springer},
      year = {2015},
      url = {https://doi.org/10.1007/978-3-662-46078-8\_21},
      doi = {10.1007/978-3-662-46078-8\_21}
    }
    

    
    
75. Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments
    Komusiewicz, C., Sorge, M., Stahl, K. In: Proceedings of the 2015 International Symposium on Experimental Algorithms (SEA 2015). Springer (2015).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/wea/KomusiewiczSS15,
      author = {Komusiewicz, Christian and Sorge, Manuel and Stahl, Kolja},
      title = {Finding Connected Subgraphs of Fixed Minimum Density: Implementation
                        and Experiments},
      booktitle = {Proceedings of the 2015 International Symposium on Experimental Algorithms (SEA 2015)},
      series = {Lecture Notes in Computer Science},
      volume = {9125},
      pages = {82--93},
      publisher = {Springer},
      year = {2015},
      url = {https://doi.org/10.1007/978-3-319-20086-6\_7},
      doi = {10.1007/978-3-319-20086-6\_7}
    }
    

    
    
76. Exploiting a hypergraph model for finding Golomb rulers
    Sorge, M., Moser, H., Niedermeier, R., Weller, M. Acta Informatica. 51, 449–471 (2014).
    (pdf)

    (bib)

    @article{DBLP:journals/acta/SorgeMNW14,
      author = {Sorge, Manuel and Moser, Hannes and Niedermeier, Rolf and Weller, Mathias},
      title = {Exploiting a hypergraph model for finding Golomb rulers},
      journal = {Acta Informatica},
      volume = {51},
      number = {7},
      pages = {449--471},
      year = {2014},
      url = {https://doi.org/10.1007/s00236-014-0202-1},
      doi = {10.1007/S00236-014-0202-1}
    }
    

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

    (bib)

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

    
    
78. The Minimum Feasible Tileset Problem
    Disser, Y., Kratsch, S., Sorge, M. In: Proceedings of the 2014 Workshop on Approximation and Online Algorithms (WAOA 2014). Springer (2014).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/waoa/DisserKS14,
      author = {Disser, Yann and Kratsch, Stefan and Sorge, Manuel},
      title = {The Minimum Feasible Tileset Problem},
      booktitle = {Proceedings of the 2014 Workshop on Approximation and Online Algorithms (WAOA 2014)},
      series = {Lecture Notes in Computer Science},
      volume = {8952},
      pages = {144--155},
      publisher = {Springer},
      year = {2014},
      url = {https://doi.org/10.1007/978-3-319-18263-6\_13},
      doi = {10.1007/978-3-319-18263-6\_13}
    }
    

    
    
79. 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 2013 International Symposium on Algorithms and Computation (ISAAC 2013). Springer (2013).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/isaac/ChenKNSSW13,
      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 2013 International Symposium on Algorithms and Computation (ISAAC 2013)},
      series = {Lecture Notes in Computer Science},
      volume = {8283},
      pages = {361--371},
      publisher = {Springer},
      year = {2013},
      url = {https://doi.org/10.1007/978-3-642-45030-3\_34},
      doi = {10.1007/978-3-642-45030-3\_34}
    }
    

    
    
80. A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems
    Froese, V., Bevern, R. van, Niedermeier, R., Sorge, M. In: Proceedings of the 2013 International Symposium on Mathematical Foundations of Computer Science (MFCS 2013). Springer (2013).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/mfcs/FroeseBNS13,
      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 2013 International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)},
      series = {Lecture Notes in Computer Science},
      volume = {8087},
      pages = {445--456},
      publisher = {Springer},
      year = {2013},
      url = {https://doi.org/10.1007/978-3-642-40313-2\_40},
      doi = {10.1007/978-3-642-40313-2\_40}
    }
    

    
    
81. On the Parameterized Complexity of Computing Graph Bisections
    Bevern, R. van, Feldmann, A.E., Sorge, M., Suchý, O. In: Proceedings of the 2013 International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013). Springer (2013).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/wg/BevernFSS13,
      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 2013 International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013)},
      series = {Lecture Notes in Computer Science},
      volume = {8165},
      pages = {76--87},
      publisher = {Springer},
      year = {2013},
      url = {https://doi.org/10.1007/978-3-642-45043-3\_8},
      doi = {10.1007/978-3-642-45043-3\_8}
    }
    

    
    
82. 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)

    (bib)

    @article{DBLP:journals/jco/MoserNS12,
      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},
      volume = {24},
      number = {3},
      pages = {347--373},
      year = {2012},
      url = {https://doi.org/10.1007/s10878-011-9391-5},
      doi = {10.1007/S10878-011-9391-5}
    }
    

    
    
83. 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)

    (bib)

    @article{DBLP:journals/jda/SorgeBNW12,
      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},
      url = {https://doi.org/10.1016/j.jda.2012.04.007},
      doi = {10.1016/J.JDA.2012.04.007}
    }
    

    
    
84. Exploiting a Hypergraph Model for Finding Golomb Rulers
    Sorge, M., Moser, H., Niedermeier, R., Weller, M. In: Proceedings of the 2012 International Symposium on Combinatorial Optimization (ISCO 2012). Springer (2012).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/iscopt/SorgeMNW12,
      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 2012 International Symposium on Combinatorial Optimization (ISCO 2012)},
      series = {Lecture Notes in Computer Science},
      volume = {7422},
      pages = {368--379},
      publisher = {Springer},
      year = {2012},
      url = {https://doi.org/10.1007/978-3-642-32147-4\_33},
      doi = {10.1007/978-3-642-32147-4\_33}
    }
    

    
    
85. Finding Dense Subgraphs of Sparse Graphs
    Komusiewicz, C., Sorge, M. In: Proceedings of the 2012 International Symposium on Parameterized and Exact Computation (IPEC 2012). Springer (2012).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/iwpec/KomusiewiczS12,
      author = {Komusiewicz, Christian and Sorge, Manuel},
      title = {Finding Dense Subgraphs of Sparse Graphs},
      booktitle = {Proceedings of the 2012 International Symposium on Parameterized and Exact Computation (IPEC 2012)},
      series = {Lecture Notes in Computer Science},
      volume = {7535},
      pages = {242--251},
      publisher = {Springer},
      year = {2012},
      url = {https://doi.org/10.1007/978-3-642-33293-7\_23},
      doi = {10.1007/978-3-642-33293-7\_23}
    }
    

    
    
86. 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 2011 International Workshop on Combinatorial Algorithms (IWOCA 2011). Springer (2011).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/iwoca/SorgeBNW11,
      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 2011 International Workshop on Combinatorial Algorithms (IWOCA 2011)},
      series = {Lecture Notes in Computer Science},
      volume = {7056},
      pages = {310--323},
      publisher = {Springer},
      year = {2011},
      url = {https://doi.org/10.1007/978-3-642-25011-8\_25},
      doi = {10.1007/978-3-642-25011-8\_25}
    }
    

    
    
87. From Few Components to an Eulerian Graph by Adding Arcs
    Sorge, M., Bevern, R. van, Niedermeier, R., Weller, M. In: Proceedings of the 2011 International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011). Springer (2011).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/wg/SorgeBNW11,
      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 2011 International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011)},
      series = {Lecture Notes in Computer Science},
      volume = {6986},
      pages = {307--318},
      publisher = {Springer},
      year = {2011},
      url = {https://doi.org/10.1007/978-3-642-25870-1\_28},
      doi = {10.1007/978-3-642-25870-1\_28}
    }
    

    
    
88. Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes
    Moser, H., Niedermeier, R., Sorge, M. In: Proceedings of the 2009 International Symposium on Experimental Algorithms (SEA 2009). Springer (2009).
    (pdf)

    (bib)

    @inproceedings{DBLP:conf/wea/MoserNS09,
      author = {Moser, Hannes and Niedermeier, Rolf and Sorge, Manuel},
      title = {Algorithms and Experiments for Clique Relaxations-Finding Maximum
                        s-Plexes},
      booktitle = {Proceedings of the 2009 International Symposium on Experimental Algorithms (SEA 2009)},
      series = {Lecture Notes in Computer Science},
      volume = {5526},
      pages = {233--244},
      publisher = {Springer},
      year = {2009},
      url = {https://doi.org/10.1007/978-3-642-02011-7\_22},
      doi = {10.1007/978-3-642-02011-7\_22}
    }
    

    
    

Theses

1. Be sparse! Be dense! Be robust!: elements of parameterized algorithmics
   Sorge, M. (2017).
   (pdf)

   (bib)

   @phdthesis{DBLP:phd/dnb/Sorge17,
     author = {Sorge, Manuel},
     title = {Be sparse! Be dense! Be robust!: elements of parameterized algorithmics},
     school = {Technical University of Berlin, Germany},
     year = {2017},
     url = {https://nbn-resolving.org/urn:nbn:de:101:1-201804164363},
     urn = {urn:nbn:de:101:1-201804164363},
     isbn = {978-3-7983-2885-3}
   }