The following pages link to Rolf Niedermeier (Q175575):
Displaying 50 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Aspects of a multivariate complexity analysis for rectangle tiling (Q408398) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- The complexity of finding effectors (Q519899) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Graph-modeled data clustering: Exact algorithms for clique generation (Q814914) (← links)
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- On the parameterized intractability of motif search problems (Q858110) (← links)
- Experiments on data reduction for optimal domination in networks (Q863574) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- Towards optimal locality in mesh-indexings (Q1348392) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Fixed-parameter algorithms for CLOSEST STRING and related problems (Q1424248) (← links)
- (Q1587369) (redirect page) (← links)
- On multidimensional curves with Hilbert property (Q1587370) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Diminishable parameterized problems and strict polynomial kernelization (Q1670737) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- Pattern-guided \(k\)-anonymity (Q1736590) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Co-clustering under the maximum norm (Q1736769) (← links)
