The following pages link to Manuel Sorge (Q329037):
Displaying 29 items.
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- The complexity of routing with few collisions (Q1679978) (← links)
- Computational complexity aspects of point visibility graphs (Q1720342) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- (Q4634388) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- (Q5009615) (← links)
- (Q5075765) (← links)
- (Q5075819) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Threshold Treewidth and Hypertree Width (Q5101317) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- The Parameterized Complexity of the Minimum Shared Edges Problem (Q5275386) (← links)
- On Kernelization and Approximation for the Vector Connectivity Problem (Q5363790) (← links)
- (Q5369516) (← links)
- Constant Congestion Brambles (Q6045401) (← links)
- (Q6065468) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
- A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments (Q6262800) (← links)
- Packing Directed Cycles Quarter- and Half-Integrally (Q6321542) (← links)
