Rolf Niedermeier

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Fair short paths in vertex-colored graphs
Theoretical Computer Science
2026-09-29Paper
Temporal connectivity: coping with foreseen and unforeseen delays
Discrete Applied Mathematics
2026-07-02Paper
Stable marriage with multi-modal preferences
Journal of Computer and System Sciences
2026-06-11Paper
Binary matrix completion under diameter constraints2026-04-21Paper
Adapting stable matchings to evolving preferences
Games and Economic Behavior
2026-03-24Paper
Applying a cut-based data reduction rule for weighted cluster editing in polynomial time2025-06-23Paper
There and back again: on applying data reduction rules by undoing others2025-06-19Paper
Drawing a map of elections
Artificial Intelligence
2025-05-30Paper
Fairness in repetitive scheduling
European Journal of Operational Research
2025-05-20Paper
Parameterized lower bounds for problems in P via fine-grained cross-compositions2024-10-08Paper
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and Applications
2024-10-08Paper
Deepening the (parameterized) complexity analysis of incremental stable matching problems2024-08-06Paper
Most classic problems remain NP-hard on relative neighborhood graphs and their relatives2024-05-27Paper
An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions2024-05-06Paper
Delay-robust routes in temporal graphs2024-04-23Paper
Approximating sparse quadratic programs
Theoretical Computer Science
2024-01-02Paper
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs2023-11-14Paper
A multivariate complexity analysis of the material consumption scheduling problem
Journal of Scheduling
2023-08-28Paper
Computing maximum matchings in temporal graphs
Journal of Computer and System Sciences
2023-07-10Paper
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Journal of Graph Algorithms and Applications
2023-07-03Paper
Multistage \(s-t\) path: confronting similarity with dissimilarity
Algorithmica
2023-06-28Paper
Equitable scheduling on a single machine
Journal of Scheduling
2023-06-27Paper
Equitable scheduling on a single machine
Journal of Scheduling
2023-06-27Paper
Temporal interval cliques and independent sets
Theoretical Computer Science
2023-05-23Paper
On finding separators in temporal split and permutation graphs
Journal of Computer and System Sciences
2023-04-21Paper
On 2-clubs in graph-based data clustering: theory and algorithm engineering2023-03-22Paper
Multidimensional stable roommates with master list
(available as arXiv preprint)
2023-03-21Paper
Polynomial-time data reduction for weighted problems beyond additive goal functions
Discrete Applied Mathematics
2023-02-22Paper
Computing maximum matchings in temporal graphs.
(available as arXiv preprint)
2023-02-07Paper
Parameterized Algorithms for Matrix Completion with Radius Constraints.
(available as arXiv preprint)
2023-02-07Paper
scientific article; zbMATH DE number 7651119 (Why is no real title available?)
(available as arXiv preprint)
2023-02-07Paper
Multistage Vertex Cover2023-02-03Paper
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters2023-02-03Paper
Recursively divisible problems2023-01-25Paper
The complexity of binary matrix completion under diameter constraints
Journal of Computer and System Sciences
2023-01-09Paper
Bribery and control in stable marriage2022-12-21Paper
Line-up elections: parallel voting with shared candidate pool
(available as arXiv preprint)
2022-12-21Paper
Feedback edge sets in temporal graphs
Graph-Theoretic Concepts in Computer Science
2022-12-21Paper
PRAM's towards realistic parallelism: BRAM's
Fundamentals of Computation Theory
2022-12-09Paper
Towards optimal locality in mesh-indexings
Fundamentals of Computation Theory
2022-12-09Paper
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
Algorithms for Sensor Systems
2022-12-09Paper
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
Information and Computation
2022-12-08Paper
The complexity of gerrymandering over graphs: paths and trees
Discrete Applied Mathematics
2022-11-11Paper
As Time Goes By: Reflections on Treewidth for Temporal Graphs
Treewidth, Kernels, and Algorithms
2022-10-19Paper
The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality
Journal of Artificial Intelligence Research
2022-10-06Paper
The structural complexity landscape of finding balance-fair shortest paths
Theoretical Computer Science
2022-09-27Paper
Complexity of shift bribery in committee elections
ACM Transactions on Computation Theory
2022-09-24Paper
Data Reduction for Maximum Matching on Real-World Graphs
ACM Journal of Experimental Algorithmics
2022-09-06Paper
Parameterized Dynamic Cluster Editing2022-07-21Paper
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality2022-07-21Paper
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
INFORMS Journal on Computing
2022-06-28Paper
On 2-clubs in graph-based data clustering: theory and algorithm engineering
Journal of Graph Algorithms and Applications
2022-06-28Paper
Towards classifying the polynomial-time solvability of temporal betweenness centrality
(available as arXiv preprint)
2022-06-08Paper
The complexity of gerrymandering over graphs: paths and trees
Graph-Theoretic Concepts in Computer Science
2022-06-08Paper
On finding separators in temporal split and permutation graphs
Fundamentals of Computation Theory
2022-05-20Paper
Multistage vertex cover
Theory of Computing Systems
2022-05-09Paper
Envy-free allocations respecting social networks
Artificial Intelligence
2022-04-11Paper
Temporal connectivity: coping with foreseen and unforeseen delays2022-01-01Paper
Temporal unit interval independent sets2022-01-01Paper
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
Psychometrika
2021-12-16Paper
Feedback edge sets in temporal graphs
Discrete Applied Mathematics
2021-12-07Paper
Bribery and control in stable marriage
Journal of Artificial Intelligence Research
2021-10-05Paper
Robustness among multiwinner voting rules
Artificial Intelligence
2021-08-16Paper
The complexity of finding small separators in temporal graphs
(available as arXiv preprint)
2021-08-04Paper
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
(available as arXiv preprint)
2021-08-04Paper
Interference-free Walks in Time: Temporally Disjoint Paths2021-05-18Paper
Multistage graph problems on a global budget
Theoretical Computer Science
2021-05-10Paper
Parameterized dynamic cluster editing
Algorithmica
2021-02-01Paper
Interference-free Walks in Time: Temporally Disjoint Paths
(available as arXiv preprint)
2021-01-01Paper
Weighted tournament solutions2020-11-12Paper
The power of linear-time data reduction for maximum matching
Algorithmica
2020-11-11Paper
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
Journal of Graph Algorithms and Applications
2020-11-05Paper
Tight hardness results for consensus problems on circular strings and time series
SIAM Journal on Discrete Mathematics
2020-10-27Paper
Diminishable parameterized problems and strict polynomial kernelization
Computability
2020-09-08Paper
The Power of Linear-Time Data Reduction for Maximum Matching2020-05-26Paper
Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
Theoretical Computer Science
2020-03-12Paper
Efficient algorithms for measuring the funnel-likeness of DAGs
Journal of Combinatorial Optimization
2020-02-03Paper
Temporal graph classes: a view through temporal separators
Theoretical Computer Science
2020-01-16Paper
The complexity of finding small separators in temporal graphs
Journal of Computer and System Sciences
2019-11-29Paper
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
Journal of Scheduling
2019-10-08Paper
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
(available as arXiv preprint)
2019-10-01Paper
Data reduction, exact, and heuristic algorithms for clique cover
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-11Paper
The parameterized complexity of the minimum shared edges problem
Journal of Computer and System Sciences
2019-08-30Paper
Multivariate algorithmics for NP-hard string problems2019-07-03Paper
Parameterized aspects of triangle enumeration
Journal of Computer and System Sciences
2019-06-25Paper
When can graph hyperbolicity be computed in linear time?
Algorithmica
2019-05-07Paper
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
Algorithmica
2019-04-25Paper
Pattern-guided k-anonymity
Algorithms
2019-03-26Paper
The parameterized complexity of the rainbow subgraph problem
Algorithms
2019-03-26Paper
Co-clustering under the maximum norm
Algorithms
2019-03-26Paper
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Networks
2019-03-06Paper
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
European Journal of Operational Research
2019-02-11Paper
A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
SIAM Journal on Discrete Mathematics
2018-12-05Paper
Temporal graph classes: a view through temporal separators
Lecture Notes in Computer Science
2018-11-22Paper
Stable roommate with narcissistic, single-peaked, and single-crossing preferences
(available as arXiv preprint)
2018-10-25Paper
Diminishable parameterized problems and strict polynomial kernelization
(available as arXiv preprint)
2018-09-06Paper
Efficient algorithms for measuring the funnel-likeness of DAGs
Lecture Notes in Computer Science
2018-08-17Paper
h-Index Manipulation by Undoing Merges
(available as arXiv preprint)
2018-07-12Paper
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
(available as arXiv preprint)
2018-04-10Paper
Fractals for kernelization lower bounds
SIAM Journal on Discrete Mathematics
2018-03-26Paper
Finding points in general position
International Journal of Computational Geometry & Applications
2018-02-22Paper
← Previous 100   1   2   3   4   Next 100 →


Research outcomes over time


This page was built for person: Rolf Niedermeier