595 results on '"Rolf Niedermeier"'
Search Results
52. Enumerating Isolated Cliques in Temporal Networks.
53. Comparing Temporal Graphs Using Dynamic Time Warping.
54. Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints.
55. Multistage Vertex Cover.
56. An Experimental View on Committees Providing Justified Representation.
57. Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters.
58. High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming.
59. Parameterized Dynamic Cluster Editing.
60. Diminishable Parameterized Problems and Strict Polynomial Kernelization.
61. Stable Marriage with Multi-Modal Preferences.
62. Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.
63. Efficient Algorithms for Measuring the Funnel-Likeness of DAGs.
64. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.
65. Envy-Free Allocations Respecting Social Networks.
66. The Complexity of Finding Small Separators in Temporal Graphs.
67. Listing All Maximal k-Plexes in Temporal Graphs.
68. Exact Mean Computation in Dynamic Time Warping Spaces.
69. Temporal Graph Classes: A View Through Temporal Separators.
70. Parameterized Aspects of Triangle Enumeration.
71. On Coalitional Manipulation for Multiwinner Elections: Shortlisting.
72. Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks.
73. The Power of Linear-Time Data Reduction for Maximum Matching.
74. Robustness Among Multiwinner Voting Rules.
75. When Can Graph Hyperbolicity Be Computed in Linear Time?
76. Assessing the Computational Complexity of Multi-layer Subgraph Detection.
77. Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences.
78. Teams in Online Scheduling Polls: Game-Theoretic Aspects.
79. The complexity of gerrymandering over graphs: Paths and trees
80. Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.
81. A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs.
82. h-Index Manipulation by Undoing Merges.
83. Finding Points in General Position.
84. Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
85. Twins in Subdivision Drawings of Hypergraphs.
86. Enumerating maximal cliques in temporal graphs.
87. Complexity of Shift Bribery in Committee Elections.
88. The structural complexity landscape of finding balance-fair shortest paths
89. The Parameterized Complexity of the Minimum Shared Edges Problem.
90. Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs.
91. Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
92. H-Index Manipulation by Merging Articles: Models, Theory, and Experiments.
93. Large-Scale Election Campaigns: Combinatorial Shift Bribery.
94. A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths.
95. Elections with Few Candidates: Prices, Weights, and Covering Problems.
96. The Complexity of Finding Effectors.
97. Elections with Few Voters: Candidate Control Can Be Easy.
98. Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.
99. Star Partitions of Perfect Graphs.
100. Win-Win Kernelization for Degree Sequence Completion Problems.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.