Manuel Sorge
Titel
Geciteerd door
Geciteerd door
Jaar
Exact combinatorial algorithms and experiments for finding maximum k-plexes
H Moser, R Niedermeier, M Sorge
Journal of combinatorial optimization 24 (3), 347-373, 2012
65*2012
Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
AS Himmel, H Molter, R Niedermeier, M Sorge
Social Network Analysis and Mining 7 (1), 35, 2017
51*2017
The complexity of arc routing problems
R van Bevern, R Niedermeier, M Sorge, M Weller
Arc Routing: Problems, Methods, and Applications, 2014
40*2014
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
C Komusiewicz, M Sorge
Discrete Applied Mathematics 193, 145-161, 2015
37*2015
A new view on Rural Postman based on Eulerian Extension and Matching
M Sorge, R Van Bevern, R Niedermeier, M Weller
Journal of Discrete Algorithms 16, 12-33, 2012
332012
From few components to an Eulerian graph by adding arcs
M Sorge, R Van Bevern, R Niedermeier, M Weller
International Workshop on Graph-Theoretic Concepts in Computer Science, 307-318, 2011
302011
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
R van Bevern, C Komusiewicz, M Sorge
Networks 70 (3), 262-278, 2017
25*2017
On the parameterized complexity of computing balanced partitions in graphs
R Van Bevern, AE Feldmann, M Sorge, O Suchý
Theory of Computing Systems 57 (1), 1-35, 2015
24*2015
Finding highly connected subgraphs
F Hüffner, C Komusiewicz, M Sorge
International Conference on Current Trends in Theory and Practice of …, 2015
202015
H-index manipulation by merging articles: Models, theory, and experiments
R Van Bevern, C Komusiewicz, R Niedermeier, M Sorge, T Walsh
Artificial Intelligence 240, 19-35, 2016
172016
Polynomial-time data reduction for the subset interconnection design problem
J Chen, C Komusiewicz, R Niedermeier, M Sorge, O Suchy, M Weller
SIAM Journal on Discrete Mathematics 29 (1), 1-25, 2015
16*2015
Exploiting hidden structure in selecting dimensions that distinguish vectors
V Froese, R Van Bevern, R Niedermeier, M Sorge
Journal of Computer and System Sciences 82 (3), 521-535, 2016
15*2016
The parameterized complexity of the minimum shared edges problem
T Fluschnik, S Kratsch, R Niedermeier, M Sorge
Journal of Computer and System Sciences 106, 23-48, 2019
132019
Constant-factor approximations for capacitated arc routing without triangle inequality
R Van Bevern, S Hartung, A Nichterlein, M Sorge
Operations Research Letters 42 (4), 290-292, 2014
132014
The graph parameter hierarchy
M Sorge
132013
How hard is it to satisfy (almost) all roommates?
J Chen, D Hermelin, M Sorge, H Yedidsion
arXiv preprint arXiv:1707.04316, 2017
122017
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
R van Bevern, T Fluschnik, GB Mertzios, H Molter, M Sorge, O Suchý
Discrete Optimization 30, 20-50, 2018
8*2018
Some algorithmic challenges in arc routing
M Sorge
Talk at NII Shonan Seminar 18, 2013
82013
Matchings under preferences: Strength of stability and trade-offs
J Chen, P Skowron, M Sorge
Proceedings of the 2019 ACM Conference on Economics and Computation, 41-59, 2019
72019
Assessing the computational complexity of multilayer subgraph detection
R Bredereck, C Komusiewicz, S Kratsch, H Molter, R Niedermeier, ...
Network Science 7 (2), 215-241, 2019
72019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20