Figiel, Aleksander; Himmel, Anne-Sophie; Nichterlein, André; Niedermeier, Rolf On 2-clubs in graph-based data clustering: theory and algorithm engineering. (English) Zbl 1489.05145 J. Graph Algorithms Appl. 25, No. 1, 521-547 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{A. Figiel} et al., J. Graph Algorithms Appl. 25, No. 1, 521--547 (2021; Zbl 1489.05145) Full Text: DOI arXiv
Koana, Tomohiro; Nichterlein, André Detecting and enumerating small induced subgraphs in \(c\)-closed graphs. (English) Zbl 1469.05077 Discrete Appl. Math. 302, 198-207 (2021). MSC: 05C30 05C60 05C90 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Koana} and \textit{A. Nichterlein}, Discrete Appl. Math. 302, 198--207 (2021; Zbl 1469.05077) Full Text: DOI arXiv
Bentert, Matthias; Haag, Roman; Hofer, Christian; Koana, Tomohiro; Nichterlein, André Parameterized complexity of min-power asymmetric connectivity. (English) Zbl 1503.68080 Theory Comput. Syst. 64, No. 7, 1158-1182 (2020). MSC: 68Q27 05C22 05C40 05C85 68M18 68Q17 68R10 68W05 PDFBibTeX XMLCite \textit{M. Bentert} et al., Theory Comput. Syst. 64, No. 7, 1158--1182 (2020; Zbl 1503.68080) Full Text: DOI arXiv
Bentert, Matthias; Haag, Roman; Hofer, Christian; Koana, Tomohiro; Nichterlein, André Parameterized complexity of min-power asymmetric connectivity. (English) Zbl 1503.68079 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11638, 85-96 (2019). MSC: 68Q27 05C22 05C40 05C85 68M18 68Q17 68R10 68W05 PDFBibTeX XMLCite \textit{M. Bentert} et al., Lect. Notes Comput. Sci. 11638, 85--96 (2019; Zbl 1503.68079) Full Text: DOI arXiv
Bentert, Matthias; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf Parameterized aspects of triangle enumeration. (English) Zbl 1430.68176 J. Comput. Syst. Sci. 103, 61-77 (2019). MSC: 68R10 05C30 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{M. Bentert} et al., J. Comput. Syst. Sci. 103, 61--77 (2019; Zbl 1430.68176) Full Text: DOI arXiv
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod When can graph hyperbolicity be computed in linear time? (English) Zbl 1439.68016 Algorithmica 81, No. 5, 2016-2045 (2019). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., Algorithmica 81, No. 5, 2016--2045 (2019; Zbl 1439.68016) Full Text: DOI Link
Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf; Picker, Marten Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments. (English) Zbl 1430.05119 Eur. J. Oper. Res. 275, No. 3, 846-864 (2019). MSC: 05C82 05C09 05C90 68Q17 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., Eur. J. Oper. Res. 275, No. 3, 846--864 (2019; Zbl 1430.05119) Full Text: DOI arXiv
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf Fractals for kernelization lower bounds. (English) Zbl 1388.68112 SIAM J. Discrete Math. 32, No. 1, 656-681 (2018). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., SIAM J. Discrete Math. 32, No. 1, 656--681 (2018; Zbl 1388.68112) Full Text: DOI arXiv
Bentert, Matthias; van Bevern, René; Nichterlein, André; Niedermeier, Rolf Parameterized algorithms for power-efficient connected symmetric wireless sensor networks. (English) Zbl 1503.68026 Fernández Anta, Antonio (ed.) et al., Algorithms for sensor systems. 13th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2017, Vienna, Austria, September 7–8, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10718, 26-40 (2017). MSC: 68M18 68Q17 68Q27 68R10 68W40 PDFBibTeX XMLCite \textit{M. Bentert} et al., Lect. Notes Comput. Sci. 10718, 26--40 (2017; Zbl 1503.68026) Full Text: DOI
Bredereck, Robert; Froese, Vincent; Koseler, Marcel; Millani, Marcelo Garlet; Nichterlein, André; Niedermeier, Rolf A parameterized algorithmics framework for degree sequence completion problems in directed graphs. (English) Zbl 1398.68219 Guo, Jiong (ed.) et al., 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). LIPIcs – Leibniz International Proceedings in Informatics 63, Article 10, 14 p. (2017). MSC: 68Q25 05C07 05C20 68Q17 68R10 PDFBibTeX XMLCite \textit{R. Bredereck} et al., LIPIcs -- Leibniz Int. Proc. Inform. 63, Article 10, 14 p. (2017; Zbl 1398.68219) Full Text: DOI arXiv
Froese, Vincent; Kanj, Iyad; Nichterlein, André; Niedermeier, Rolf Finding points in general position. (English) Zbl 1386.68196 Int. J. Comput. Geom. Appl. 27, No. 4, 277-296 (2017). MSC: 68U05 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. Froese} et al., Int. J. Comput. Geom. Appl. 27, No. 4, 277--296 (2017; Zbl 1386.68196) Full Text: DOI arXiv
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf Fractals for kernelization lower bounds, with an application to length-bounded cut problems. (English) Zbl 1388.68111 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 25, 14 p. (2016). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 25, 14 p. (2016; Zbl 1388.68111) Full Text: DOI
Bredereck, Robert; Chen, Jiehua; Faliszewski, Piotr; Nichterlein, André; Niedermeier, Rolf Prices matter for the parameterized complexity of shift bribery. (English) Zbl 1354.91052 Inf. Comput. 251, 140-164 (2016). MSC: 91B12 91B14 68Q17 68Q25 68W25 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Inf. Comput. 251, 140--164 (2016; Zbl 1354.91052) Full Text: DOI arXiv
Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf Parameterized algorithmics for graph modification problems: on interactions with heuristics. (English) Zbl 1417.68055 Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 3-15 (2016). MSC: 68Q17 05C85 90C35 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., Lect. Notes Comput. Sci. 9224, 3--15 (2016; Zbl 1417.68055) Full Text: DOI arXiv
Froese, Vincent; Nichterlein, André; Niedermeier, Rolf Win-win kernelization for degree sequence completion problems. (English) Zbl 1345.68156 J. Comput. Syst. Sci. 82, No. 6, 1100-1111 (2016). MSC: 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. Froese} et al., J. Comput. Syst. Sci. 82, No. 6, 1100--1111 (2016; Zbl 1345.68156) Full Text: DOI
Bazgan, Cristina; Bredereck, Robert; Hartung, Sepp; Nichterlein, André; Woeginger, Gerhard J. Finding large degree-anonymous subgraphs is hard. (English) Zbl 1335.68095 Theor. Comput. Sci. 622, 90-110 (2016). MSC: 68Q17 05C85 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Theor. Comput. Sci. 622, 90--110 (2016; Zbl 1335.68095) Full Text: DOI
Bredereck, Robert; Froese, Vincent; Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod The complexity of degree anonymization by vertex addition. (English) Zbl 1332.68164 Theor. Comput. Sci. 607, Part 1, 16-34 (2015). MSC: 68R10 05C76 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Theor. Comput. Sci. 607, Part 1, 16--34 (2015; Zbl 1332.68164) Full Text: DOI
Hartung, Sepp; Nichterlein, André NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. (English) Zbl 1330.68114 SIAM J. Discrete Math. 29, No. 4, 1931-1960 (2015). MSC: 68Q25 05C20 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Hartung} and \textit{A. Nichterlein}, SIAM J. Discrete Math. 29, No. 4, 1931--1960 (2015; Zbl 1330.68114) Full Text: DOI arXiv
Hüffner, Falk; Komusiewicz, Christian; Nichterlein, André Editing graphs into few cliques: complexity, approximation, and kernelization schemes. (English) Zbl 1451.68203 Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 410-421 (2015). MSC: 68R10 05C69 68Q17 68Q27 68W25 68W40 PDFBibTeX XMLCite \textit{F. Hüffner} et al., Lect. Notes Comput. Sci. 9214, 410--421 (2015; Zbl 1451.68203) Full Text: DOI
Bazgan, Cristina; Nichterlein, André; Niedermeier, Rolf A refined complexity analysis of finding the most vital edges for undirected shortest paths. (English) Zbl 1459.68152 Paschos, Vangelis Th. (ed.) et al., Algorithms and complexity. 9th international conference, CIAC 2015, Paris, France, May 20–22, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9079, 47-60 (2015). MSC: 68R10 05C38 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Lect. Notes Comput. Sci. 9079, 47--60 (2015; Zbl 1459.68152) Full Text: DOI
Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Suchý, Ondřej A refined complexity analysis of degree anonymization in graphs. (English) Zbl 1327.68134 Inf. Comput. 243, 249-262 (2015). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Hartung} et al., Inf. Comput. 243, 249--262 (2015; Zbl 1327.68134) Full Text: DOI
Bredereck, Robert; Köhler, Thomas; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese Using patterns to form homogeneous teams. (English) Zbl 1322.90074 Algorithmica 71, No. 2, 517-538 (2015). MSC: 90C27 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Algorithmica 71, No. 2, 517--538 (2015; Zbl 1322.90074) Full Text: DOI
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André; Suchý, Ondřej On structural parameterizations for the 2-club problem. (English) Zbl 1311.05051 Discrete Appl. Math. 185, 79-92 (2015). MSC: 05C12 05C69 05C60 68Q17 PDFBibTeX XMLCite \textit{S. Hartung} et al., Discrete Appl. Math. 185, 79--92 (2015; Zbl 1311.05051) Full Text: DOI arXiv
Bredereck, Robert; Froese, Vincent; Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod The complexity of degree anonymization by vertex addition. (English) Zbl 1445.68153 Gu, Qianping (ed.) et al., Algorithmic aspects in information and management. 10th international conference, AAIM 2014, Vancouver, BC, Canada, July 8–11, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8546, 44-55 (2014). MSC: 68R10 05C76 68Q17 68Q27 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Lect. Notes Comput. Sci. 8546, 44--55 (2014; Zbl 1445.68153) Full Text: DOI
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian Parameterized inapproximability of target set selection and generalizations. (English) Zbl 1432.68186 Beckmann, Arnold (ed.) et al., Language, life, limits. 10th conference on computability in Europe, CiE 2014, Budapest, Hungary, June 23–27, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8493, 11-20 (2014). MSC: 68Q27 60J70 68Q17 68R10 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Lect. Notes Comput. Sci. 8493, 11--20 (2014; Zbl 1432.68186) Full Text: DOI arXiv
Bazgan, Cristina; Chopin, Morgan; Nichterlein, André; Sikora, Florian Parameterized inapproximability of target set selection and generalizations. (English) Zbl 1320.68088 Computability 3, No. 2, 135-145 (2014). MSC: 68Q17 05C90 68R10 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Computability 3, No. 2, 135--145 (2014; Zbl 1320.68088) Full Text: DOI
Froese, Vincent; Nichterlein, André; Niedermeier, Rolf Win-win kernelization for degree sequence completion problems. (English) Zbl 1417.68067 Ravi, R. (ed.) et al., Algorithm theory – SWAT 2014. 14th Scandinavian symposium and workshops, Copenhagen, Denmark, July 2–4, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8503, 194-205 (2014). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{V. Froese} et al., Lect. Notes Comput. Sci. 8503, 194--205 (2014; Zbl 1417.68067) Full Text: DOI arXiv
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese The effect of homogeneity on the computational complexity of combinatorial data anonymization. (English) Zbl 1281.68120 Data Min. Knowl. Discov. 28, No. 1, 65-91 (2014). MSC: 68Q17 68R05 68P15 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Data Min. Knowl. Discov. 28, No. 1, 65--91 (2014; Zbl 1281.68120) Full Text: DOI
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf Pattern-guided \(k\)-anonymity. (English) Zbl 1461.68071 Algorithms (Basel) 6, No. 4, 678-701 (2013). MSC: 68P25 68Q17 68Q27 90C10 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Algorithms (Basel) 6, No. 4, 678--701 (2013; Zbl 1461.68071) Full Text: DOI
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André On structural parameterizations for the 2-club problem. (English) Zbl 1303.68093 van Emde Boas, Peter (ed.) et al., SOFSEM 2013: theory and practice of computer science. 39th international conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 26–31, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-35842-5/pbk). Lecture Notes in Computer Science 7741, 233-243 (2013). MSC: 68R10 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Hartung} et al., Lect. Notes Comput. Sci. 7741, 233--243 (2013; Zbl 1303.68093) Full Text: DOI arXiv
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf Pattern-guided \(k\)-anonymity. (English) Zbl 1303.68059 Fellows, Michael (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Third joint international conference, FAW-AAIM 2013, Dalian, China, June 26–28, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38755-5/pbk). Lecture Notes in Computer Science 7924, 350-361 (2013). MSC: 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Lect. Notes Comput. Sci. 7924, 350--361 (2013; Zbl 1303.68059) Full Text: DOI
Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Suchý, Ondřej A refined complexity analysis of degree anonymization in graphs. (English) Zbl 1327.68133 Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-39211-5/pbk). Lecture Notes in Computer Science 7966, 594-606 (2013). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Hartung} et al., Lect. Notes Comput. Sci. 7966, 594--606 (2013; Zbl 1327.68133) Full Text: DOI
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André Parameterized algorithmics and computational experiments for finding 2-clubs. (English) Zbl 1375.68065 Thilikos, Dimitrios M. (ed.) et al., Parameterized and exact computation. 7th international symposium, IPEC 2012, Ljubljana, Slovenia, September 12–14, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33292-0/pbk). Lecture Notes in Computer Science 7535, 231-241 (2012). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Hartung} et al., Lect. Notes Comput. Sci. 7535, 231--241 (2012; Zbl 1375.68065) Full Text: DOI
Hartung, Sepp; Nichterlein, André NP-hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. (English) Zbl 1330.68113 Cooper, S. Barry (ed.) et al., How the world computes. Turing centenary conference and 8th conference on computability in Europe, CiE 2012, Cambridge, UK, June 18–23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30869-7/pbk). Lecture Notes in Computer Science 7318, 283-292 (2012). MSC: 68Q25 05C20 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Hartung} and \textit{A. Nichterlein}, Lect. Notes Comput. Sci. 7318, 283--292 (2012; Zbl 1330.68113) Full Text: DOI arXiv
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese The effect of homogeneity on the complexity of \(k\)-anonymity. (English) Zbl 1342.68154 Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 53-64 (2011). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Lect. Notes Comput. Sci. 6914, 53--64 (2011; Zbl 1342.68154) Full Text: DOI
Bredereck, Robert; Nichterlein, André; Niedermeier, Rolf; Philip, Geevarghese Pattern-guided data anonymization and clustering. (English) Zbl 1343.68105 Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22–26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 182-193 (2011). MSC: 68Q25 68P25 68Q17 PDFBibTeX XMLCite \textit{R. Bredereck} et al., Lect. Notes Comput. Sci. 6907, 182--193 (2011; Zbl 1343.68105) Full Text: DOI
Nichterlein, André; Niedermeier, Rolf; Uhlmann, Johannes; Weller, Mathias On tractable cases of target set selection. (English) Zbl 1310.68115 Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15–17, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17516-9/pbk). Lecture Notes in Computer Science 6506, 378-389 (2010). MSC: 68Q25 05C82 68Q17 PDFBibTeX XMLCite \textit{A. Nichterlein} et al., Lect. Notes Comput. Sci. 6506, 378--389 (2010; Zbl 1310.68115) Full Text: DOI