1,271 results on '"Niedermeier, Rolf"'
Search Results
152. Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences
153. Assessing the Computational Complexity of Multi-layer Subgraph Detection
154. Preface of the Special Issue on Theoretical Aspects of Computer Science (2018)
155. When Can Graph Hyperbolicity be Computed in Linear Time?
156. A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
157. Inductive k-independent graphs and c-colorable subgraphs in scheduling: a review
158. Exact mean computation in dynamic time warping spaces
159. Polynomial Time Data Reduction for Dominating Set
160. Parameterized Intractability of Motif Search Problems
161. Parameterized Algorithms for Colored Clustering
162. Fair Short Paths in Vertex-Colored Graphs
163. Data Reduction for Domination in Graphs
164. Parameterization in Computational Social Choice
165. Twins in Subdivision Drawings of Hypergraphs
166. Efficient computation of optimal temporal walks under waiting-time constraints
167. Stable roommates with narcissistic, single-peaked, and single-crossing preferences
168. Prices matter for the parameterized complexity of shift bribery
169. H-index manipulation by merging articles: Models, theory, and experiments
170. Elections with Few Candidates: Prices, Weights, and Covering Problems
171. A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
172. The Complexity of Finding Effectors
173. Modification-Fair Cluster Editing
174. The complexity of binary matrix completion under diameter constraints
175. Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
176. Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes
177. Network-Based Dissolution
178. Combinatorial Voter Control in Elections
179. Star Partitions of Perfect Graphs
180. Co-Clustering Under the Maximum Norm
181. The Parameterized Complexity of the Rainbow Subgraph Problem
182. The Complexity of Degree Anonymization by Vertex Addition
183. The complexity of degree anonymization by vertex addition
184. Exact Mean Computation in Dynamic Time Warping Spaces
185. Diminishable Parameterized Problems and Strict Polynomial Kernelization
186. Efficient Algorithms for Measuring the Funnel-Likeness of DAGs
187. Temporal Graph Classes: A View Through Temporal Separators
188. A refined complexity analysis of degree anonymization in graphs
189. Combinatorial voter control in elections
190. A refined complexity analysis of fair districting over graphs
191. A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
192. The Complexity of Finding Effectors
193. Effective and Efficient Data Reduction for the Subset Interconnection Design Problem
194. How to Put through Your Agenda in Collective Binary Decisions
195. A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems
196. On Explaining Integer Vectors by Few Homogenous Segments
197. A Refined Complexity Analysis of Degree Anonymization in Graphs
198. Pattern-Guided k-Anonymity
199. Evaluation of ILP-Based Approaches for Partitioning into Colorful Components
200. Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.