pith. sign in

Andr\'e Nichterlein

Identifiers

  • name variant Andr\'e Nichterlein 0.60 · backfill

Papers (44)

  1. On the Parameterized Complexity of Bounded-Density Vertex Deletion cs.DS · 2026 · author #4
  2. Designing Approximate Binary Trees for Trees cs.DS · 2026 · author #3
  3. Parameterized Complexity of Segment Routing cs.CC · 2025 · author #3
  4. SpiderDAN: Matching Augmentation in Demand-Aware Networks cs.DS · 2024 · author #3
  5. Destroying Densest Subgraphs is Hard cs.DS · 2024 · author #2
  6. Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions cs.DS · 2023 · author #2
  7. Correlating Theory and Practice in Finding Clubs and Plexes cs.DS · 2022 · author #3
  8. Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma cs.DS · 2022 · author #2
  9. There and Back Again: On Applying Data Reduction Rules by Undoing Others cs.DS · 2022 · author #3
  10. Covering Many (or Few) Edges with k Vertices in Sparse Graphs cs.DS · 2022 · author #3
  11. Combating Collusion Rings is Hard but Possible cs.GT · 2021 · author #3
  12. Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality cs.DS · 2021 · author #3
  13. Using a geometric lens to find k disjoint shortest paths math.CO · 2020 · author #2
  14. Detecting and Enumerating Small Induced Subgraphs in $c$-Closed Graphs cs.DS · 2020 · author #2
  15. On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering cs.DS · 2020 · author #3
  16. Parameterized Complexity of Min-Power Asymmetric Connectivity cs.DS · 2020 · author #5
  17. Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions cs.DS · 2019 · author #4
  18. Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints cs.DS · 2019 · author #3
  19. Parameterized Dynamic Cluster Editing cs.DM · 2018 · author #3
  20. Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments cs.DS · 2018 · author #2
  21. Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments cs.DS · 2018 · author #3
  22. A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths cs.CC · 2018 · author #3
  23. Parameterized Complexity of Diameter cs.DS · 2018 · author #2
  24. An Adaptive Version of Brandes' Algorithm for Betweenness Centrality cs.DS · 2018 · author #4
  25. Kernelization Lower Bounds for Finding Constant-Size Subgraphs cs.CC · 2017 · author #3
  26. Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments cs.DS · 2017 · author #3
  27. A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs cs.DS · 2017 · author #2
  28. Parameterized Aspects of Triangle Enumeration cs.DS · 2017 · author #3
  29. When can Graph Hyperbolicity be computed in Linear Time? cs.CC · 2017 · author #4
  30. Fixed-Parameter Algorithms for DAG Partitioning cs.DS · 2016 · author #6
  31. The Power of Data Reduction for Matching cs.DS · 2016 · author #2
  32. Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics cs.DS · 2016 · author #2
  33. A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs cs.DM · 2016 · author #5
  34. Fractals for Kernelization Lower Bounds cs.CC · 2015 · author #3
  35. Finding Points in General Position cs.CG · 2015 · author #3
  36. Prices Matter for the Parameterized Complexity of Shift Bribery cs.MA · 2015 · author #4
  37. Win-Win Kernelization for Degree Sequence Completion Problems cs.DM · 2014 · author #2
  38. Constant-factor approximations for Capacitated Arc Routing without triangle inequality cs.DS · 2014 · author #3
  39. Parameterized Inapproximability of Target Set Selection and Generalizations cs.CC · 2014 · author #3
  40. Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks cs.SI · 2014 · author #3
  41. On Structural Parameterizations for the 2-Club Problem cs.CC · 2013 · author #3
  42. Parameterized Approximability of Maximizing the Spread of Influence in Networks cs.DS · 2013 · author #3
  43. On the Parameterized and Approximation Hardness of Metric Dimension cs.CC · 2012 · author #2
  44. NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs cs.CC · 2011 · author #2

Mentions

  • 2501.03871 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2411.11426 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2404.08599 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2301.00797 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1910.00277 #4 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2212.07533 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2211.07001 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2201.05465 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2206.14698 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2007.12502 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1706.03177 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2112.08444 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2105.13055 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1806.09683 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1802.10048 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2007.12077 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1609.08879 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2006.14972 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2005.14620 #5 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1802.06701 #4 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1909.01152 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1807.07516 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1702.06548 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1810.06625 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1710.07601 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1703.05598 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1804.09155 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1604.06302 #5 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1512.00333 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1508.01097 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1702.06503 #4 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1611.08809 #6 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1502.01253 #4 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1606.03268 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1404.5432 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1403.3565 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1303.6907 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1404.3660 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1402.6239 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1305.3735 #3 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1211.1636 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1110.1510 #2 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 2606.26012 #4 · arxiv_oai · confidence 0.70 Andr\'e Nichterlein
  • 1508.01097 #3 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1502.01253 #4 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1404.5432 #2 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1404.3660 #3 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1403.3565 #3 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1402.6239 #3 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1305.3735 #3 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1303.6907 #3 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1211.1636 #2 · backfill · confidence 0.70 Andr\'e Nichterlein
  • 1110.1510 #2 · backfill · confidence 0.70 Andr\'e Nichterlein

Frequent Coauthors