The following pages link to Rolf Niedermeier (Q175575):
Displayed 50 items.
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745) (← links)
- A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Automated generation of search tree algorithms for hard graphs modification problems (Q1882409) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits (Q1892887) (← 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)
- Optimal deterministic sorting and routing on grids and tori with diagonals (Q1961046) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- Stable roommate with narcissistic, single-peaked, and single-crossing preferences (Q1990314) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Bribery and control in stable marriage (Q2109958) (← links)
- Line-up elections: parallel voting with shared candidate pool (Q2109967) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Multistage vertex cover (Q2135630) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Combinatorial voter control in elections (Q2346381) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Parameterized intractability of distinguishing substring selection (Q2432546) (← links)
- The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Parameterized complexity of Vertex Cover variants (Q2464318) (← links)
- Tree decompositions of graphs: saving memory in dynamic programming (Q2465936) (← links)
- Error compensation in leaf power problems (Q2498407) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Towards classifying the polynomial-time solvability of temporal betweenness centrality (Q2672438) (← links)
- The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Multidimensional stable roommates with master list (Q2692267) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
- (Q2721971) (← links)
- (Q2728900) (← links)
- An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover (Q2729644) (← links)