The following pages link to Hannes Moser (Q471186):
Displaying 28 items.
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- On Generating Triangle-Free Graphs (Q2839211) (← links)
- Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
- Measuring Indifference: Unit Interval Vertex Deletion (Q3057628) (← links)
- Exploiting a Hypergraph Model for Finding Golomb Rulers (Q3167640) (← links)
- Kernelization through Tidying (Q3557047) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Isolation Concepts for Enumerating Dense Subgraphs (Q3608840) (← links)
- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (Q3612599) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Efficient Algorithms for Eulerian Extension and Rural Postman (Q5300482) (← links)
- The Parameterized Complexity of the Unique Coverage Problem (Q5387796) (← links)
- A Generalization of Nemhauser and Trotter's Local Optimization Theorem. (Q5389995) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- Enumerating Isolated Cliques in Synthetic and Financial Networks (Q5505678) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5892184) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
