PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Nichterlein, André"

Author of the publication

copydeleteadd this publication to your clipboard
Covering Many (or Few) Edges with k Vertices in Sparse Graphs.

, , , and . CoRR, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

André Jaquemod University of Stuttgart

Univ. -Prof. Dr. rer. nat. André Thess University of Stuttgart

Dr. -Ing. André Buchau University of Stuttgart

André Weiß University of Stuttgart

André Loescher University of Stuttgart

 

Other publications of authors with the same name

On tractable cases of Target Set Selection., , , and . Social Netw. Analys. Mining, 3 (2): 233-256 (2013)Parameterized approximability of maximizing the spread of influence in networks., , , and . J. Discrete Algorithms, (2014)Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics., , and . CoRR, (2016)Kernelization Lower Bounds for Finding Constant Size Subgraphs., , and . CoRR, (2017)Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments., , , and . CoRR, (2018)Towards Improving Brandes' Algorithm for Betweenness Centrality., , , , and . CoRR, (2018)Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems., , , and . ICALP, volume 55 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Parameterized Complexity of Diameter., and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 50-61. Springer, (2019)Parameterized Inapproximability of Degree Anonymization., and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 75-84. Springer, (2014)Win-Win Kernelization for Degree Sequence Completion Problems., , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 194-205. Springer, (2014)