44 results on '"Niedermeier, Rolf"'
Search Results
2. A multivariate complexity analysis of the material consumption scheduling problem
3. Multistage s–t Path: Confronting Similarity with Dissimilarity
4. Equitable scheduling on a single machine
5. Interference-free walks in time: temporally disjoint paths
6. A refined complexity analysis of fair districting over graphs
7. Multistage Vertex Cover
8. Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes
9. Parameterized Dynamic Cluster Editing
10. The Power of Linear-Time Data Reduction for Maximum Matching
11. Preface of STACS 2019 Special Issue
12. Efficient algorithms for measuring the funnel-likeness of DAGs
13. On coalitional manipulation for multiwinner elections: shortlisting
14. Preface of the Special Issue on Theoretical Aspects of Computer Science (2018)
15. When Can Graph Hyperbolicity be Computed in Linear Time?
16. A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
17. Inductive k-independent graphs and c-colorable subgraphs in scheduling: a review
18. Exact mean computation in dynamic time warping spaces
19. Comparing temporal graphs using dynamic time warping
20. Efficient computation of optimal temporal walks under waiting-time constraints
21. Stable roommates with narcissistic, single-peaked, and single-crossing preferences
22. Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
23. A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
24. The Complexity of Finding Effectors
25. Using Patterns to Form Homogeneous Teams
26. Exploiting a hypergraph model for finding Golomb rulers
27. Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation
28. Constant Thresholds Can Make Target Set Selection Tractable
29. The effect of homogeneity on the computational complexity of combinatorial data anonymization
30. The Parameterized Complexity of Local Search for TSP, More Refined
31. On tractable cases of Target Set Selection
32. Exact combinatorial algorithms and experiments for finding maximum k-plexes
33. Parameterized computational complexity of finding small-diameter subgraphs
34. Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion
35. Separator-based data reduction for signed graph balancing
36. Fixed-Parameter Algorithms for Cluster Vertex Deletion
37. Improved Algorithms and Complexity Results for Power Domination in Graphs
38. Parameterized Complexity of Vertex Cover Variants
39. Experiments on data reduction for optimal domination in networks
40. Parameterized Intractability of Distinguishing Substring Selection
41. On The Parameterized Intractability Of Motif Search Problems*
42. Error Compensation in Leaf Power Problems
43. Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
44. Automated Generation of Search Tree Algorithms for Hard Graph Modification 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.