Andr Nichterlein
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
43
Venues
20
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
43 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ALENEX | Efficient Algorithms for Temporal Balanced Graph Partitioning of Datacenter Workloads. | Aleksander Figiel, Andr Nichterlein, Stefan Schmid |
| 2026 | IWOCA | Parameterized Algorithms for Computing MAD Trees. | Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, Andr Nichterlein, Camille Richer |
| 2026 | MFCS | On the Parameterized Complexity of Bounded-Density Vertex Deletion. | Jakob Raupach, Tom-Lukas Breitkopf, Anton Herrmann, Andr Nichterlein |
| 2026 | STACS | Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. | Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, Andr Nichterlein |
| 2026 | WALCOM | On the Computational Complexity of Covering Multi-Interface Networks. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2025 | ALENEX | SpiderDAN: Matching Augmentation in Demand-Aware Networks. | Aleksander Figiel, Darya Melnyk, Andr Nichterlein, Arash Pourdamghani, Stefan Schmid |
| 2025 | CIAC | On the Computational Complexity of Graph Reconstruction. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2025 | INFOCOM | Parameterized Complexity of Segment Routing. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2024 | SPAA | Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. | Aleksander Figiel, Darya Melnyk, Andr Nichterlein, Arash Pourdamghani, Stefan Schmid |
| 2023 | ESA | Correlating Theory and Practice in Finding Clubs and Plexes. | Aleksander Figiel, Tomohiro Koana, Andr Nichterlein, Niklas Wnsche |
| 2023 | STACS | Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. | Klaus Heeger, Andr Nichterlein, Rolf Niedermeier |
| 2022 | AAAI | Combating Collusion Rings Is Hard but Possible. | Niclas Boehmer, Robert Bredereck, Andr Nichterlein |
| 2022 | ESA | There and Back Again: On Applying Data Reduction Rules by Undoing Others. | Aleksander Figiel, Vincent Froese, Andr Nichterlein, Rolf Niedermeier |
| 2022 | STACS | Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. | Tomohiro Koana, Christian Komusiewicz, Andr Nichterlein, Frank Sommer |
| 2021 | CIAC | On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. | Aleksander Figiel, Anne-Sophie Himmel, Andr Nichterlein, Rolf Niedermeier |
| 2021 | ICALP | Using a Geometric Lens to Find k Disjoint Shortest Paths. | Matthias Bentert, Andr Nichterlein, Malte Renken, Philipp Zschoche |
| 2021 | WG | Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. | Maciej Rymar, Hendrik Molter, Andr Nichterlein, Rolf Niedermeier |
| 2019 | CIAC | Parameterized Complexity of Diameter. | Matthias Bentert, Andr Nichterlein |
| 2019 | IWOCA | Parameterized Complexity of Min-Power Asymmetric Connectivity. | Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, Andr Nichterlein |
| 2018 | CiE | Kernelization Lower Bounds for Finding Constant-Size Subgraphs. | Till Fluschnik, George B. Mertzios, Andr Nichterlein |
| 2018 | ESA | Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. | Viatcheslav Korenwein, Andr Nichterlein, Rolf Niedermeier, Philipp Zschoche |
| 2018 | ISAAC | An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. | Matthias Bentert, Alexander Dittmann, Leon Kellerhals, Andr Nichterlein, Rolf Niedermeier |
| 2017 | Algosensors | Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. | Matthias Bentert, Ren van Bevern, Andr Nichterlein, Rolf Niedermeier |
| 2017 | FCT | Parameterized Aspects of Triangle Enumeration. | Matthias Bentert, Till Fluschnik, Andr Nichterlein, Rolf Niedermeier |
| 2017 | MFCS | The Power of Linear-Time Data Reduction for Maximum Matching. | George B. Mertzios, Andr Nichterlein, Rolf Niedermeier |
| 2017 | WADS | When Can Graph Hyperbolicity Be Computed in Linear Time? | Till Fluschnik, Christian Komusiewicz, George B. Mertzios, Andr Nichterlein, Rolf Niedermeier, Nimrod Talmon |
| 2016 | ICALP | Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. | Till Fluschnik, Danny Hermelin, Andr Nichterlein, Rolf Niedermeier |
| 2015 | CIAC | A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. | Cristina Bazgan, Andr Nichterlein, Rolf Niedermeier |
| 2015 | WADS | Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. | Falk Hffner, Christian Komusiewicz, Andr Nichterlein |
| 2015 | WG | Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. | Christian Komusiewicz, Andr Nichterlein, Rolf Niedermeier |
| 2014 | AAAI | Prices Matter for the Parameterized Complexity of Shift Bribery. | Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Andr Nichterlein, Rolf Niedermeier |
| 2014 | AAIM | The Complexity of Degree Anonymization by Vertex Addition. | Robert Bredereck, Vincent Froese, Sepp Hartung, Andr Nichterlein, Rolf Niedermeier, Nimrod Talmon |
| 2014 | CiE | Parameterized Inapproximability of Target Set Selection and Generalizations. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora |
| 2013 | AAIM | Pattern-Guided | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier |
| 2013 | CIAC | Parameterized Complexity of DAG Partitioning. | Ren van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hffner, Andr Nichterlein, Ondrej Such |
| 2013 | COCOON | Parameterized Approximability of Maximizing the Spread of Influence in Networks. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora |
| 2013 | ICALP | A Refined Complexity Analysis of Degree Anonymization in Graphs. | Sepp Hartung, Andr Nichterlein, Rolf Niedermeier, Ondrej Such |
| 2013 | ISAAC | The Complexity of Finding a Large Subgraph under Anonymity Constraints. | Robert Bredereck, Sepp Hartung, Andr Nichterlein, Gerhard J. Woeginger |
| 2013 | SOFSEM | On Structural Parameterizations for the 2-Club Problem. | Sepp Hartung, Christian Komusiewicz, Andr Nichterlein |
| 2012 | CiE | NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. | Sepp Hartung, Andr Nichterlein |
| 2011 | FCT | The Effect of Homogeneity on the Complexity of k-Anonymity. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | MFCS | Pattern-Guided Data Anonymization and Clustering. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2010 | ISAAC | On Tractable Cases of Target Set Selection. | Andr Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller |