The following pages link to Manuel Sorge (Q329037):
Displaying 50 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)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- On (coalitional) exchange-stable matching (Q2670926) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems (Q2849932) (← links)
- On the Parameterized Complexity of Computing Graph Bisections (Q2864292) (← links)
- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem (Q2872100) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
- A New View on Rural Postman Based on Eulerian Extension and Matching (Q3111660) (← links)
- Exploiting a Hypergraph Model for Finding Golomb Rulers (Q3167640) (← links)
- (Q3386631) (← links)
- Polynomial-Time Data Reduction for the Subset Interconnection Design Problem (Q3453561) (← links)
- h-Index Manipulation by Undoing Merges (Q4576225) (← links)
- (Q4634388) (← links)
- Finding Dense Subgraphs of Sparse Graphs (Q4899257) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- (Q5009615) (← links)
- Constant Congestion Brambles in Directed Graphs (Q5071097) (← links)
- (Q5075765) (← links)
- (Q5075819) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- Threshold Treewidth and Hypertree Width (Q5101317) (← links)
- The Parameterized Complexity of Centrality Improvement in Networks (Q5127175) (← links)
- Finding Highly Connected Subgraphs (Q5175112) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- (Q5271449) (← links)
- The Parameterized Complexity of the Minimum Shared Edges Problem (Q5275386) (← links)
- Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362) (← links)
- On Kernelization and Approximation for the Vector Connectivity Problem (Q5363790) (← links)
- (Q5369516) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5919399) (← links)
- Constant Congestion Brambles (Q6045401) (← links)
