43 results on '"Niedermeier, Rolf"'
Search Results
2. Temporal interval cliques and independent sets
3. Polynomial-time data reduction for weighted problems beyond additive goal functions
4. The complexity of gerrymandering over graphs: Paths and trees
5. The structural complexity landscape of finding balance-fair shortest paths
6. Envy-free allocations respecting social networks
7. Feedback edge sets in temporal graphs
8. Robustness among multiwinner voting rules
9. Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments
10. H-index manipulation by merging articles: Models, theory, and experiments
11. The complexity of degree anonymization by vertex addition
12. Combinatorial voter control in elections
13. Incremental list coloring of graphs, parameterized by conservation
14. Graph-based data clustering with overlaps
15. Isolation concepts for clique enumeration: Comparison and computational experiments
16. Fixed-parameter algorithms for Kemeny rankings
17. Isolation concepts for efficiently enumerating dense subgraphs
18. Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
19. Algorithms for compact letter displays: Comparison and evaluation
20. Tree decompositions of graphs: Saving memory in dynamic programming
21. Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
22. Computing the similarity of two sequences with nested arc annotations
23. Towards optimal locality in mesh-indexings
24. Faster exact algorithms for hard problems: A parameterized point of view
25. SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
26. Aspects of a multivariate complexity analysis for Rectangle Tiling
27. A new view on Rural Postman based on Eulerian Extension and Matching.
28. Deconstructing intractability—A multivariate complexity analysis of interval constrained coloring.
29. Fixed-parameter tractability results for feedback set problems in tournaments.
30. Red-blue covering problems and the consecutive ones property.
31. Exact algorithms and applications for Tree-like Weighted Set Cover.
32. An efficient fixed-parameter algorithm for 3-Hitting Set.
33. A general method to speed up fixed-parameter-tractable algorithms
34. Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting.
35. Temporal graph classes: A view through temporal separators.
36. Editorial
37. Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs.
38. Unambiguous computations and locally definable acceptance types
39. On Bounded-Degree Vertex Deletion parameterized by treewidth
40. Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
41. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
42. Multistage graph problems on a global budget.
43. Closest 4-leaf power is fixed-parameter tractable
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.