André Nichterlein

145 papers A* 5A 9B 20C 10Misc 1Journal 89Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. STACS Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein
2026	J	`jnl`	Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density. CoRR Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein
2026	A	`conf`	Efficient Algorithms for Temporal Balanced Graph Partitioning of Datacenter Workloads. ALENEX Aleksander Figiel, André Nichterlein, Stefan Schmid
2026	J	`jnl`	Graph clustering problems under the lens of parameterized local search. J. Comput. Syst. Sci. Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
2026	B	`conf`	On the Computational Complexity of Covering Multi-Interface Networks. WALCOM Cristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer
2026	J	`jnl`	Parameterized Algorithms for Computing MAD Trees. CoRR Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein, Camille Richer
2025	J	`jnl`	Destroying densest subgraphs is hard. J. Comput. Syst. Sci. Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
2025	J	`jnl`	Effective data reduction for strongly stable matching in very sparse graphs. Inf. Process. Lett. Rosa Wolf, Klaus Heeger, André Nichterlein
2025	—	`conf`	On the Computational Complexity of Graph Reconstruction. CIAC (1) Cristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer
2025	J	`jnl`	On the hardness of problems around s-clubs on split graphs. Discret. Appl. Math. Cristina Bazgan, Pinar Heggernes, André Nichterlein, Thomas Pontoizeau
2025	A*	`conf`	Parameterized Complexity of Segment Routing. INFOCOM Cristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer
2025	J	`jnl`	Parameterized Complexity of Segment Routing. CoRR Cristina Bazgan, Morgan Chopin, André Nichterlein, Camille Richer
2025	A	`conf`	SpiderDAN: Matching Augmentation in Demand-Aware Networks. ALENEX Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid
2024	B	`conf`	Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. SPAA Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid
2024	—	`conf`	Destroying Densest Subgraphs Is Hard. SWAT Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
2024	J	`jnl`	Destroying Densest Subgraphs is Hard. CoRR Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
2024	J	`jnl`	Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier
2024	J	`jnl`	SpiderDAN: Matching Augmentation in Demand-Aware Networks. CoRR Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid
2023	A	`conf`	Correlating Theory and Practice in Finding Clubs and Plexes. ESA Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
2023	B	`conf`	Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller
2023	J	`jnl`	Parameterized Complexity of Diameter. Algorithmica Matthias Bentert, André Nichterlein
2023	A	`conf`	Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS Klaus Heeger, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR Klaus Heeger, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2023	J	`jnl`	Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
2022	B	`conf`	Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand
2022	A*	`conf`	Combating Collusion Rings Is Hard but Possible. AAAI Niclas Boehmer, Robert Bredereck, André Nichterlein
2022	J	`jnl`	Correlating Theory and Practice in Finding Clubs and Plexes. CoRR Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche
2022	A	`conf`	Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022	J	`jnl`	Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
2022	J	`jnl`	Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. CoRR Tomohiro Koana, André Nichterlein, Niklas Wünsche
2022	J	`jnl`	Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov
2022	A	`conf`	There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
2022	J	`jnl`	There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	Combating Collusion Rings is Hard but Possible. CoRR Niclas Boehmer, Robert Bredereck, André Nichterlein
2021	J	`jnl`	Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2021	J	`jnl`	Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
2021	J	`jnl`	Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. Tomohiro Koana, André Nichterlein
2021	C	`conf`	On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	Parameterized Dynamic Cluster Editing. Algorithmica Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	B	`conf`	The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche
2021	B	`conf`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	J	`jnl`	Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2021	A*	`conf`	Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
2020	J	`jnl`	An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2020	J	`jnl`	Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs. CoRR Tomohiro Koana, André Nichterlein
2020	J	`jnl`	Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2020	J	`jnl`	On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CoRR Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier
2020	J	`jnl`	Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2020	J	`jnl`	Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2020	J	`jnl`	The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica George B. Mertzios, André Nichterlein, Rolf Niedermeier
2020	J	`jnl`	Using a geometric lens to find k disjoint shortest paths. CoRR Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche
2019	J	`jnl`	A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
2019	—	`conf`	Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. Eur. J. Oper. Res. Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
2019	C	`conf`	Parameterized Complexity of Diameter. CIAC Matthias Bentert, André Nichterlein
2019	C	`conf`	Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
2019	J	`jnl`	Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2019	J	`jnl`	When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2018	J	`jnl`	A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. George B. Mertzios, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CoRR Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
2018	B	`conf`	An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2018	A	`conf`	Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ESA Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche
2018	J	`jnl`	Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. CoRR Viatcheslav Korenwein, André Nichterlein, Philipp Zschoche, Rolf Niedermeier
2018	J	`jnl`	Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. CoRR Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker
2018	J	`jnl`	Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2018	C	`conf`	Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE Till Fluschnik, George B. Mertzios, André Nichterlein
2018	J	`jnl`	Parameterized Complexity of Diameter. CoRR Matthias Bentert, André Nichterlein
2018	—	`conf`	Parameterized Dynamic Cluster Editing. FSTTCS Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Parameterized Dynamic Cluster Editing. CoRR Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2018	J	`jnl`	Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Finding Points in General Position. Int. J. Comput. Geom. Appl. Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2017	J	`jnl`	Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR Till Fluschnik, George B. Mertzios, André Nichterlein
2017	J	`jnl`	Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR George B. Mertzios, André Nichterlein, Rolf Niedermeier
2017	C	`conf`	Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	Parameterized Aspects of Triangle Enumeration. FCT Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parameterized Aspects of Triangle Enumeration. CoRR Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier
2017	J	`jnl`	Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	The Power of Linear-Time Data Reduction for Maximum Matching. MFCS George B. Mertzios, André Nichterlein, Rolf Niedermeier
2017	B	`conf`	When Can Graph Hyperbolicity Be Computed in Linear Time? WADS Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2017	J	`jnl`	When can Graph Hyperbolicity be computed in Linear Time? CoRR Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2016	B	`conf`	A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier
2016	—	`conf`	Finding Points in General Position. CCCG Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
2016	J	`jnl`	Fine-Grained Algorithm Design for Matching. CoRR George B. Mertzios, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Fixed-Parameter Algorithms for DAG Partitioning. CoRR René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2016	A*	`conf`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. CoRR Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Prices matter for the parameterized complexity of shift bribery. Inf. Comput. Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2016	J	`jnl`	Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. Vincent Froese, André Nichterlein, Rolf Niedermeier
2015	C	`conf`	A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CIAC Cristina Bazgan, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	A refined complexity analysis of degree anonymization in graphs. Inf. Comput. Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
2015	—	`—`	Degree-constrained editing of small-degree graphs. André Nichterlein
2015	B	`conf`	Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. WADS Falk Hüffner, Christian Komusiewicz, André Nichterlein
2015	J	`jnl`	Finding Points in General Position. CoRR Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM J. Discret. Math. Sepp Hartung, André Nichterlein
2015	J	`jnl`	On structural parameterizations for the 2-club problem. Discret. Appl. Math. Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
2015	J	`jnl`	Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. J. Graph Algorithms Appl. Sepp Hartung, Christian Komusiewicz, André Nichterlein
2015	B	`conf`	Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. WG Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2015	J	`jnl`	The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2015	J	`jnl`	Using Patterns to Form Homogeneous Teams. Algorithmica Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2014	J	`jnl`	Constant Thresholds Can Make Target Set Selection Tractable. Theory Comput. Syst. Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller
2014	J	`jnl`	Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
2014	J	`jnl`	Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge
2014	B	`conf`	Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. SEA Sepp Hartung, Clemens Hoffmann, André Nichterlein
2014	J	`jnl`	Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. CoRR Sepp Hartung, Clemens Hoffmann, André Nichterlein
2014	B	`conf`	Parameterized Inapproximability of Degree Anonymization. IPEC Cristina Bazgan, André Nichterlein
2014	C	`conf`	Parameterized Inapproximability of Target Set Selection and Generalizations. CiE Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2014	J	`jnl`	Parameterized Inapproximability of Target Set Selection and Generalizations. Comput. Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2014	J	`jnl`	Parameterized Inapproximability of Target Set Selection and Generalizations. CoRR Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2014	J	`jnl`	Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2014	A*	`conf`	Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier
2014	C	`conf`	The Complexity of Degree Anonymization by Vertex Addition. AAIM Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
2014	J	`jnl`	The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2014	—	`conf`	Win-Win Kernelization for Degree Sequence Completion Problems. SWAT Vincent Froese, André Nichterlein, Rolf Niedermeier
2014	J	`jnl`	Win-Win Kernelization for Degree Sequence Completion Problems. CoRR Vincent Froese, André Nichterlein, Rolf Niedermeier
2013	—	`conf`	A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý
2013	J	`jnl`	On Structural Parameterizations for the 2-Club Problem CoRR Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý
2013	B	`conf`	On Structural Parameterizations for the 2-Club Problem. SOFSEM Sepp Hartung, Christian Komusiewicz, André Nichterlein
2013	A	`conf`	On the Parameterized and Approximation Hardness of Metric Dimension. CCC Sepp Hartung, André Nichterlein
2013	J	`jnl`	On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller
2013	J	`jnl`	Parameterized Approximability of Maximizing the Spread of Influence in Networks CoRR Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2013	Misc	`conf`	Parameterized Approximability of Maximizing the Spread of Influence in Networks. COCOON Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
2013	C	`conf`	Parameterized Complexity of DAG Partitioning. CIAC René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý
2013	—	`conf`	Pattern-Guided FAW-AAIM Robert Bredereck, André Nichterlein, Rolf Niedermeier
2013	J	`jnl`	Pattern-Guided Algorithms Robert Bredereck, André Nichterlein, Rolf Niedermeier
2013	B	`conf`	The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
2012	—	`conf`	Constant Thresholds Can Make Target Set Selection Tractable. MedAlg Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller
2012	C	`conf`	NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. CiE Sepp Hartung, André Nichterlein
2012	J	`jnl`	On the Parameterized and Approximation Hardness of Metric Dimension CoRR Sepp Hartung, André Nichterlein
2012	B	`conf`	Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. IPEC Sepp Hartung, Christian Komusiewicz, André Nichterlein
2011	J	`jnl`	Aspects of a multivariate complexity analysis for Rectangle Tiling. Oper. Res. Lett. André Nichterlein, Michael Dom, Rolf Niedermeier
2011	B	`conf`	Pattern-Guided Data Anonymization and Clustering. MFCS Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2011	J	`jnl`	Realizing Degree Sequences for Directed Acyclic Graphs is Hard CoRR André Nichterlein
2011	B	`conf`	The Effect of Homogeneity on the Complexity of k-Anonymity. FCT Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
2010	—	`conf`	On Tractable Cases of Target Set Selection. ISAAC (1) André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller