default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Nichterlein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j42]Rosa Wolf, Klaus Heeger, André Nichterlein
:
Effective data reduction for strongly stable matching in very sparse graphs. Inf. Process. Lett. 188: 106534 (2025)- 2024
- [j41]Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67(4): 70-79 (2024) - [c49]Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid:
Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. SPAA 2024: 447-449 - [c48]Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
Destroying Densest Subgraphs Is Hard. SWAT 2024: 6:1-6:17 - [i41]Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
Destroying Densest Subgraphs is Hard. CoRR abs/2404.08599 (2024) - [i40]Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid:
SpiderDAN: Matching Augmentation in Demand-Aware Networks. CoRR abs/2411.11426 (2024) - 2023
- [j40]Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. Algorithmica 85(2): 325-351 (2023) - [j39]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328: 117-133 (2023) - [j38]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27(3): 173-194 (2023) - [j37]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37(3): 1674-1703 (2023) - [c47]Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Correlating Theory and Practice in Finding Clubs and Plexes. ESA 2023: 47:1-47:18 - [c46]Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller:
Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC 2023: 20:1-20:19 - [c45]Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS 2023: 35:1-35:19 - [i39]Klaus Heeger, André Nichterlein, Rolf Niedermeier:
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR abs/2301.00797 (2023) - 2022
- [j36]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov:
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. 34(1): 55-75 (2022) - [c44]Niclas Boehmer, Robert Bredereck, André Nichterlein:
Combating Collusion Rings Is Hard but Possible. AAAI 2022: 4843-4850 - [c43]Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA 2022: 53:1-53:15 - [c42]Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand:
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC 2022: 25:1-25:14 - [c41]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS 2022: 42:1-42:18 - [i38]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR abs/2201.05465 (2022) - [i37]Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR abs/2206.14698 (2022) - [i36]Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. CoRR abs/2211.07001 (2022) - [i35]Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Correlating Theory and Practice in Finding Clubs and Plexes. CoRR abs/2212.07533 (2022) - 2021
- [j35]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. Algorithmica 83(1): 1-44 (2021) - [j34]Tomohiro Koana, André Nichterlein:
Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. 302: 198-207 (2021) - [j33]Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26: 1.3:1-1.3:30 (2021) - [j32]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. 25(1): 521-547 (2021) - [j31]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65(7): 1141-1142 (2021) - [c40]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC 2021: 216-230 - [c39]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP 2021: 26:1-26:14 - [c38]Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche:
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC 2021: 26:1-26:18 - [c37]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG 2021: 219-231 - [i34]Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. CoRR abs/2105.13055 (2021) - [i33]Niclas Boehmer, Robert Bredereck, André Nichterlein:
Combating Collusion Rings is Hard but Possible. CoRR abs/2112.08444 (2021) - 2020
- [j30]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
The Power of Linear-Time Data Reduction for Maximum Matching. Algorithmica 82(12): 3521-3565 (2020) - [j29]Matthias Bentert, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1): 73 (2020) - [j28]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. 24(3): 483-522 (2020) - [j27]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 64(7): 1158-1182 (2020) - [i32]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. CoRR abs/2005.14620 (2020) - [i31]Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CoRR abs/2006.14972 (2020) - [i30]Tomohiro Koana, André Nichterlein:
Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs. CoRR abs/2007.12077 (2020) - [i29]Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
Using a geometric lens to find k disjoint shortest paths. CoRR abs/2007.12502 (2020)
2010 – 2019
- 2019
- [j26]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Algorithmica 81(4): 1584-1614 (2019) - [j25]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica 81(5): 2016-2045 (2019) - [j24]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker:
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. Eur. J. Oper. Res. 275(3): 846-864 (2019) - [j23]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized aspects of triangle enumeration. J. Comput. Syst. Sci. 103: 61-77 (2019) - [j22]Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks 73(1): 23-37 (2019) - [c36]Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. CIAC 2019: 50-61 - [c35]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints. COMPLEX NETWORKS (2) 2019: 494-506 - [c34]Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
Parameterized Complexity of Min-Power Asymmetric Connectivity. IWOCA 2019: 85-96 - [i28]Anne-Sophie Himmel, Matthias Bentert, André Nichterlein, Rolf Niedermeier:
Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints. CoRR abs/1909.01152 (2019) - [i27]Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions. CoRR abs/1910.00277 (2019) - 2018
- [j21]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds. SIAM J. Discret. Math. 32(1): 656-681 (2018) - [j20]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. SIAM J. Discret. Math. 32(4): 2820-2835 (2018) - [c33]Till Fluschnik, George B. Mertzios, André Nichterlein:
Kernelization Lower Bounds for Finding Constant-Size Subgraphs. CiE 2018: 183-193 - [c32]Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ESA 2018: 53:1-53:13 - [c31]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. FSTTCS 2018: 46:1-46:15 - [c30]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC 2018: 36:1-36:13 - [i26]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR abs/1802.06701 (2018) - [i25]Matthias Bentert, André Nichterlein:
Parameterized Complexity of Diameter. CoRR abs/1802.10048 (2018) - [i24]Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg:
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CoRR abs/1804.09155 (2018) - [i23]Viatcheslav Korenwein, André Nichterlein, Philipp Zschoche, Rolf Niedermeier:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. CoRR abs/1806.09683 (2018) - [i22]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker:
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. CoRR abs/1807.07516 (2018) - [i21]Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. CoRR abs/1810.06625 (2018) - 2017
- [j19]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220: 134-160 (2017) - [j18]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. Int. J. Comput. Geom. Appl. 27(4): 277-296 (2017) - [c29]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks. ALGOSENSORS 2017: 26-40 - [c28]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. FCT 2017: 96-110 - [c27]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
The Power of Linear-Time Data Reduction for Maximum Matching. MFCS 2017: 46:1-46:14 - [c26]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS 2017: 397-408 - [i20]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When can Graph Hyperbolicity be computed in Linear Time? CoRR abs/1702.06503 (2017) - [i19]Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
Parameterized Aspects of Triangle Enumeration. CoRR abs/1702.06548 (2017) - [i18]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs. CoRR abs/1703.05598 (2017) - [i17]Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier:
Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. CoRR abs/1706.03177 (2017) - [i16]Till Fluschnik, George B. Mertzios, André Nichterlein:
Kernelization Lower Bounds for Finding Constant Size Subgraphs. CoRR abs/1710.07601 (2017) - 2016
- [j17]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251: 140-164 (2016) - [j16]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-win kernelization for degree sequence completion problems. J. Comput. Syst. Sci. 82(6): 1100-1111 (2016) - [j15]Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622: 90-110 (2016) - [c25]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CCCG 2016: 7-14 - [c24]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. ICALP 2016: 25:1-25:14 - [c23]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. IPEC 2016: 10:1-10:14 - [i15]Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier:
A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems. CoRR abs/1604.06302 (2016) - [i14]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. CoRR abs/1606.03268 (2016) - [i13]George B. Mertzios, André Nichterlein, Rolf Niedermeier:
Fine-Grained Algorithm Design for Matching. CoRR abs/1609.08879 (2016) - [i12]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-Parameter Algorithms for DAG Partitioning. CoRR abs/1611.08809 (2016) - 2015
- [b1]André Nichterlein:
Degree-constrained editing of small-degree graphs. Berlin Institute of Technology, 2015 - [j14]Robert Bredereck, Thomas Köhler, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Using Patterns to Form Homogeneous Teams. Algorithmica 71(2): 517-538 (2015) - [j13]Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185: 79-92 (2015) - [j12]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243: 249-262 (2015) - [j11]Sepp Hartung, Christian Komusiewicz, André Nichterlein:
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. J. Graph Algorithms Appl. 19(1): 155-190 (2015) - [j10]Sepp Hartung, André Nichterlein:
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM J. Discret. Math. 29(4): 1931-1960 (2015) - [j9]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The complexity of degree anonymization by vertex addition. Theor. Comput. Sci. 607: 16-34 (2015) - [c22]Cristina Bazgan, André Nichterlein, Rolf Niedermeier:
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CIAC 2015: 47-60 - [c21]Falk Hüffner, Christian Komusiewicz, André Nichterlein:
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. WADS 2015: 410-421 - [c20]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. WG 2015: 3-15 - [i11]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR abs/1502.01253 (2015) - [i10]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CoRR abs/1508.01097 (2015) - [i9]Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. CoRR abs/1512.00333 (2015) - 2014
- [j8]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. Comput. 3(2): 135-145 (2014) - [j7]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The effect of homogeneity on the computational complexity of combinatorial data anonymization. Data Min. Knowl. Discov. 28(1): 65-91 (2014) - [j6]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27: 54-65 (2014) - [j5]Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. Theory Comput. Syst. 55(1): 61-83 (2014) - [j4]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. Oper. Res. Lett. 42(4): 290-292 (2014) - [c19]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI 2014: 1398-1404 - [c18]Robert Bredereck, Vincent Froese, Sepp Hartung, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Degree Anonymization by Vertex Addition. AAIM 2014: 44-55 - [c17]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CiE 2014: 11-20 - [c16]Cristina Bazgan, André Nichterlein:
Parameterized Inapproximability of Degree Anonymization. IPEC 2014: 75-84 - [c15]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-Win Kernelization for Degree Sequence Completion Problems. SWAT 2014: 194-205 - [c14]Sepp Hartung, Clemens Hoffmann, André Nichterlein:
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. SEA 2014: 376-387 - [i8]Sepp Hartung, Clemens Hoffmann, André Nichterlein:
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks. CoRR abs/1402.6239 (2014) - [i7]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CoRR abs/1403.3565 (2014) - [i6]René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. CoRR abs/1404.3660 (2014) - [i5]Vincent Froese, André Nichterlein, Rolf Niedermeier:
Win-Win Kernelization for Degree Sequence Completion Problems. CoRR abs/1404.5432 (2014) - 2013
- [j3]Robert Bredereck, André Nichterlein, Rolf Niedermeier:
Pattern-Guided k-Anonymity. Algorithms 6(4): 678-701 (2013) - [j2]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On tractable cases of Target Set Selection. Soc. Netw. Anal. Min. 3(2): 233-256 (2013) - [c13]Robert Bredereck, André Nichterlein, Rolf Niedermeier:
Pattern-Guided k-Anonymity. FAW-AAIM 2013: 350-361 - [c12]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Parameterized Complexity of DAG Partitioning. CIAC 2013: 49-60 - [c11]Sepp Hartung, André Nichterlein:
On the Parameterized and Approximation Hardness of Metric Dimension. CCC 2013: 266-276 - [c10]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. COCOON 2013: 543-554 - [c9]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) 2013: 594-606 - [c8]Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
The Complexity of Finding a Large Subgraph under Anonymity Constraints. ISAAC 2013: 152-162 - [c7]Sepp Hartung, Christian Komusiewicz, André Nichterlein:
On Structural Parameterizations for the 2-Club Problem. SOFSEM 2013: 233-243 - [i4]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. CoRR abs/1303.6907 (2013) - [i3]Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On Structural Parameterizations for the 2-Club Problem. CoRR abs/1305.3735 (2013) - 2012
- [c6]Sepp Hartung, André Nichterlein:
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. CiE 2012: 283-292 - [c5]Sepp Hartung, Christian Komusiewicz, André Nichterlein:
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. IPEC 2012: 231-241 - [c4]Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. MedAlg 2012: 120-133 - [i2]Sepp Hartung, André Nichterlein:
On the Parameterized and Approximation Hardness of Metric Dimension. CoRR abs/1211.1636 (2012) - 2011
- [j1]André Nichterlein, Michael Dom, Rolf Niedermeier:
Aspects of a multivariate complexity analysis for Rectangle Tiling. Oper. Res. Lett. 39(5): 346-351 (2011) - [c3]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
The Effect of Homogeneity on the Complexity of k-Anonymity. FCT 2011: 53-64 - [c2]Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Pattern-Guided Data Anonymization and Clustering. MFCS 2011: 182-193 - [i1]André Nichterlein:
Realizing Degree Sequences for Directed Acyclic Graphs is Hard. CoRR abs/1110.1510 (2011) - 2010
- [c1]André Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller:
On Tractable Cases of Target Set Selection. ISAAC (1) 2010: 378-389
Coauthor Index
[j41] [j39] [j38] [c45] [i39] [j36] [c43] [c42] [i37] [j35] [j33] [j32] [c40] [c37] [i34] [j30] [j29] [j28] [i31] [j26] [j25] [j24] [j23] [j22] [c35] [i28] [i27] [j21] [j20] [c32] [c31] [c30] [i26] [i24] [i23] [i22] [i21] [j18] [c29] [c28] [c27] [c26] [i20] [i19] [i18] [i17] [j17] [j16] [c25] [c24] [c23] [i15] [i14] [i13] [j14] [j12] [j9] [c22] [c20] [i11] [i10] [i9] [j7] [j5] [c19] [c18] [c15] [i5] [j3] [j2] [c13] [c9] [c4] [j1] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-02 18:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
