| Multistage Vertex Cover | 0 | 0.34 | 2022 |
| Envy-free allocations respecting social networks | 0 | 0.34 | 2022 |
| Equitable Scheduling On A Single Machine | 0 | 0.34 | 2021 |
| Two Influence Maximization Games on Graphs Made Temporal. | 0 | 0.34 | 2021 |
| Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments | 0 | 0.34 | 2021 |
| Optimal Virtual Network Embeddings for Tree Topologies | 0 | 0.34 | 2021 |
| Faster Binary Mean Computation Under Dynamic Time Warping | 0 | 0.34 | 2020 |
| Multistage s-t Path - Confronting Similarity with Dissimilarity in Temporal Graphs. | 0 | 0.34 | 2020 |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. | 0 | 0.34 | 2020 |
| Algorithmic Aspects of Temporal Betweenness | 0 | 0.34 | 2020 |
| Line-Up Elections: Parallel Voting with Shared Candidate Pool | 0 | 0.34 | 2020 |
| Preface of the Special Issue on Theoretical Aspects of Computer Science (2018) | 0 | 0.34 | 2020 |
| Parameterized Algorithms for Matrix Completion With Radius Constraints | 0 | 0.34 | 2020 |
| Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381). | 0 | 0.34 | 2019 |
| Listing All Maximal -Plexes in Temporal Graphs. | 0 | 0.34 | 2019 |
| An Experimental View on Committees Providing Justified Representation. | 0 | 0.34 | 2019 |
| Comparing temporal graphs using dynamic time warping | 0 | 0.34 | 2018 |
| Towards Improving Brandes' Algorithm for Betweenness Centrality. | 1 | 0.37 | 2018 |
| Hardness of Consensus Problems for Circular Strings and Time Series Averaging. | 1 | 0.35 | 2018 |
| An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. | 0 | 0.34 | 2018 |
| Temporal Graph Classes: A View Through Temporal Separators. | 2 | 0.41 | 2018 |
| Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. | 0 | 0.34 | 2018 |
| Parameterized aspects of triangle enumeration | 6 | 0.43 | 2017 |
| When can Graph Hyperbolicity be computed in Linear Time? | 6 | 0.43 | 2017 |
| Teams in Online Scheduling Polls: Game-Theoretic Aspects. | 0 | 0.34 | 2017 |
| Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting | 2 | 0.38 | 2017 |
| H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. | 3 | 0.46 | 2016 |
| Enumerating Maximal Cliques in Temporal Graphs. | 11 | 0.55 | 2016 |
| A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack | 8 | 0.46 | 2015 |
| Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems | 2 | 0.40 | 2015 |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 0 | 0.34 | 2015 |
| Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. | 1 | 0.36 | 2015 |
| Elections with Few Candidates: Prices, Weights, and Covering Problems | 9 | 0.48 | 2015 |
| Network-Based Vertex Dissolution. | 2 | 0.39 | 2015 |
| Prices Matter for the Parameterized Complexity of Shift Bribery. | 14 | 0.57 | 2015 |
| Combinatorial Voter Control in Elections. | 4 | 0.42 | 2015 |
| Win-Win Kernelization for Degree Sequence Completion Problems. | 6 | 0.44 | 2014 |
| Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage | 4 | 0.39 | 2014 |
| On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. | 3 | 0.43 | 2014 |
| Star Partitions of Perfect Graphs. | 2 | 0.39 | 2014 |
| Confluence in data reduction: bridging graph transformation and kernelization | 0 | 0.34 | 2013 |
| Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. | 3 | 0.52 | 2013 |
| Efficient Algorithms for Eulerian Extension and Rural Postman. | 11 | 0.59 | 2013 |
| How to Put through Your Agenda in Collective Binary Decisions. | 0 | 0.34 | 2013 |
| Interval scheduling and colorful independent sets. | 13 | 0.58 | 2012 |
| Exact combinatorial algorithms and experiments for finding maximum k-plexes | 15 | 0.64 | 2012 |
| A new view on rural postman based on eulerian extension and matching | 12 | 0.62 | 2012 |
| Parameterized computational complexity of finding small-diameter subgraphs. | 26 | 0.96 | 2012 |
| Partitioning into colorful components by minimum edge deletions | 6 | 0.52 | 2012 |
| New races in parameterized algorithmics | 17 | 0.75 | 2012 |
