Skip to main content

5 Result(s)

within Manuel Sorge Remove this filter Computer Systems Organization and Communication Networks Remove this filter

and

  1. Article

    Open Access

    The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs

    The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is permitted or forbidden; a walk ...

    Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk… in Algorithmica (2023)

    Download PDF (848 KB) View Article

  2. No Access

    Chapter and Conference Paper

    On (Coalitional) Exchange-Stable Matching

    We study , which Alcalde [Economic Design, 1995] introduced as an alternative solution concept for matching markets involving property rights, such as assigning persons to ...

    Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge in Algorithmic Game Theory (2021)

  3. No Access

    Article

    The Minimum Feasible Tileset Problem

    We introduce and study the Minimum Feasible Tileset problem: given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario ca...

    Yann Disser, Stefan Kratsch, Manuel Sorge in Algorithmica (2019)

  4. No Access

    Article

    On Kernelization and Approximation for the Vector Connectivity Problem

    In the Vector Connectivity problem we are given an undirected graph \(G=(V,E)\) ...

    Stefan Kratsch, Manuel Sorge in Algorithmica (2017)

  5. No Access

    Article

    Exploiting a hypergraph model for finding Golomb rulers

    Golomb rulers are special rulers where for any two marks it holds that the distance between them is unique. They find applications in radio frequency selection, radio astronomy, data encryption, communication ...

    Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller in Acta Informatica (2014)