M. Bentert and A. Nichterlein, "Parameterized Complexity of Diameter" , Algorithmica, vol. 85, no. 2, pp. 325–351, 2023.

DOI

10.1007/s00453-022-01032-9

Weblink

https://doi.org/10.1007/s00453-022-01032-9

Datei

https://doi.org/10.1007/s00453-022-01032-9

M. Bentert, R. Bevern, T. Fluschnik, A. Nichterlein and R. Niedermeier, "Polynomial-time data reduction for weighted problems beyond additive goal functions" , Discrete Applied Mathematics, vol. 328, pp. 117–133, 2023.

DOI

10.1016/j.dam.2022.11.018

Datei

https://doi.org/10.1016/j.dam.2022.11.018

M. Bentert, R. Bevern, A. Nichterlein, R. Niedermeier and P. V. Smirnov, "Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments" , Informs Journal on Computing, vol. 34, no. 1, pp. 55--75, 2022.

DOI

10.1287/ijoc.2020.1045

Weblink

https://arxiv.org/abs/1706.03177

H. Schulz, A. Nichterlein, R. Niedermeier and C. Weyand, "Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time" in Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC 22), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. pp. 25:1–25:14.

DOI

10.4230/LIPIcs.IPEC.2022.25

Weblink

https://drops.dagstuhl.de/opus/volltexte/2022/17381

N. Boehmer, R. Bredereck and A. Nichterlein, "Combating Collusion Rings is Hard but Possible" in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI '22), 2022. pp. 4843–4850.

Weblink

https://arxiv.org/abs/2112.08444

T. Koana, C. Komusiewicz, A. Nichterlein and F. Sommer, "Covering Many (Or Few) Edges with k Vertices in Sparse Graphs" in Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 22), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. pp. 42:1–42:18.

DOI

10.4230/LIPIcs.STACS.2022.42

Weblink

https://doi.org/10.4230/LIPIcs.STACS.2022.42

A. Figiel, V. Froese, A. Nichterlein and R. Niedermeier, "There and Back Again: On Applying Data Reduction Rules by Undoing Others" in Proceedings of the 30th Annual European Symposium on Algorithms (ESA '22), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. pp. 53:1–53:15.

DOI

10.4230/LIPICS.ESA.2022.53

Weblink

https://arxiv.org/abs/2206.14698

M. Bentert, A. Nichterlein, M. Renken and P. Zschoche, "Using a Geometric Lens to Find $k$ Disjoint Shortest Paths" in Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021. pp. 26:1–26:14.

DOI

10.4230/LIPICS.ICALP.2021.26

Weblink

https://arxiv.org/abs/2007.12502

M. Rymar, H. Molter, A. Nichterlein and R. Niedermeier, "Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality" in Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '21), Springer, 2021. pp. 219–231.

DOI

10.1007/978-3-030-86838-3_17

Weblink

https://arxiv.org/abs/2105.13055

A. Figiel, A. Himmel, A. Nichterlein and R. Niedermeier, "On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering" in Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC '21), Springer, 2021. pp. 216–230.

DOI

10.1007/978-3-030-75242-2_15

Weblink

https://arxiv.org/abs/2006.14972

J. Luo, H. Molter, A. Nichterlein and R. Niedermeier, "Parameterized Dynamic Cluster Editing" , Algorithmica, vol. 83, no. 1, pp. 1–44, 2021. Springer.

DOI

10.1007/S00453-020-00746-Y

Weblink

https://arxiv.org/abs/1810.06625

M. Bentert, R. Haag, C. Hofer, T. Koana and A. Nichterlein, "Parameterized Complexity of Min-Power Asymmetric Connectivity" , Theory of Computing Systems, vol. 65, no. 7, pp. 1141–1142, 2021.

DOI

10.1007/S00224-021-10057-6

Weblink

https://arxiv.org/abs/2005.14620

T. Koana and A. Nichterlein, "Detecting and enumerating small induced subgraphs in c-closed graphs" , Discrete Applied Mathematics, vol. 302, pp. 198–207, 2021. Elsevier.

DOI

10.1016/J.DAM.2021.06.019

Weblink

https://arxiv.org/abs/2007.12077

T. Koana, V. Korenwein, A. Nichterlein, R. Niedermeier and P. Zschoche, "Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments" , ACM Journal of Experimental Algorithmics, vol. 24, pp. 1–30, 2021. ACM.

DOI

https://doi.org/10.1145/3439801

Weblink

https://dl.acm.org/doi/abs/10.1145/3439801

E. Ulitzsch, Q. He, V. Ulitzsch, A. Nichterlein, H. Molter, R. Niedermeier and S. Pohl, "Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes" , Psychometrika, pp. 1–25, 2021. Springer.

DOI

10.1007/s11336-020-09743-0

Weblink

https://link.springer.com/article/10.1007/s11336-020-09743-0

M. Bentert, A. Dittmann, L. Kellerhals, A. Nichterlein and R. Niedermeier, "An Adaptive Version of Brandes' Algorithm for Betweenness Centrality" , Journal of Graph Algorithms and Applications, vol. 24, no. 3, pp. 483–522, 2020.

DOI

10.7155/jgaa.00543

Weblink

https://arxiv.org/pdf/1802.06701

M. Bentert, A. Himmel, A. Nichterlein and R. Niedermeier, "Efficient computation of optimal temporal walks under waiting-time constraints" , Applied Network Science, vol. 5, no. 73, pp. 1–26, 2020.

DOI

10.1007/s41109-020-00311-0

Weblink

https://arxiv.org/abs/1909.01152

G. B. Mertzios, A. Nichterlein and R. Niedermeier, "The Power of Linear-Time Data Reduction for Maximum Matching" , Algorithmica, vol. 82, pp. 3521–3565, 2020. Springer.

DOI

10.1007/S00453-020-00736-0

Weblink

https://arxiv.org/abs/1609.08879v3

M. Bentert, R. Haag, C. Hofer, T. Koana and A. Nichterlein, "Parameterized Complexity of Min-Power Asymmetric Connectivity" in Proceedings of the 30th International Workshop (IWOCA '19), Springer, 2019. pp. 85–96.

DOI

10.1007/978-3-030-25005-8_8

ISBN

978-3-030-25004-1

Weblink

https://arxiv.org/abs/2005.14620

M. Bentert and A. Nichterlein, "Parameterized Complexity of Diameter" in Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC '19), Springer, 2019. pp. 50–61.

DOI

10.1007/978-3-030-17402-6_5

Weblink

https://arxiv.org/abs/1802.10048

A. Himmel, M. Bentert, A. Nichterlein and R. Niedermeier, "Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints" in Proceedings of the 8th International Conference on Complex Networks and their Applications, Springer, 2019. pp. 494–506.

DOI

10.1007/978-3-030-36683-4_40

Weblink

https://arxiv.org/abs/1909.01152

M. Bentert, T. Fluschnik, A. Nichterlein and R. Niedermeier, "Parameterized aspects of triangle enumeration" , Journal of Computer and System Sciences, vol. 103, pp. 61 - 77, 2019.

DOI

10.1016/j.jcss.2019.02.004

Weblink

https://arxiv.org/abs/1702.06548

T. Fluschnik, C. Komusiewicz, G. B. Mertzios, A. Nichterlein, R. Niedermeier and N. Talmon, "When Can Graph Hyperbolicity be Computed in Linear Time?" , Algorithmica, vol. 81, no. 5, pp. 2016–2045, 2019.

DOI

10.1007/s00453-018-0522-6

Weblink

https://arxiv.org/abs/1702.06503

C. Bazgan, T. Fluschnik, A. Nichterlein, R. Niedermeier and M. Stahlberg, "A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths" , Networks, vol. 73, no. 1, pp. 23–37, 2019.

DOI

10.1002/net.21832

Weblink

https://arxiv.org/abs/1804.09155

C. Komusiewicz, A. Nichterlein, R. Niedermeier and M. Picker, "Exact Algorithms for Finding Well-Connected 2-Clubs in Sparse Real-World Graphs: Theory and Experiments" , European Journal of Operational Research, vol. 275, no. 3, pp. 846–864, 2019.

DOI

10.1016/j.ejor.2018.12.006

Weblink

https://arxiv.org/abs/1807.07516

R. Bredereck, V. Froese, M. Koseler, M. G. Millani, A. Nichterlein and R. Niedermeier, "A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems" , Algorithmica, vol. 81, no. 4, pp. 1584–1614, 2019.

DOI

10.1007/s00453-018-0494-6

Weblink

http://arxiv.org/abs/1604.06302

G. B. Mertzios, A. Nichterlein and R. Niedermeier, "A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs" , SIAM Journal on Discrete Mathematics, vol. 32, no. 4, pp. 2820-2835, 2018.

DOI

10.1137/17M1120920

Weblink

https://arxiv.org/abs/1703.05598

T. Fluschnik, D. Hermelin, A. Nichterlein and R. Niedermeier, "Fractals for Kernelization Lower Bounds" , SIAM Journal on Discrete Mathematics, vol. 32, no. 1, pp. 656–681, 2018.

DOI

10.1137/16M1088740

Weblink

http://arxiv.org/abs/1512.00333

M. Bentert, A. Dittmann, L. Kellerhals, A. Nichterlein and R. Niedermeier, "An Adaptive Version of Brandes' Algorithm for Betweenness Centrality" in Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. pp. 36:1–36:13.

DOI

10.4230/LIPIcs.ISAAC.2018.36

Weblink

https://arxiv.org/abs/1802.06701

V. Korenwein, A. Nichterlein, R. Niedermeier and P. Zschoche, "Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments" in Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. pp. 53:1–53:13.

DOI

10.4230/LIPICS.ESA.2018.53

Weblink

https://arxiv.org/abs/1806.09683

T. Fluschnik, G. B. Mertzios and A. Nichterlein, "Kernelization Lower Bounds for Finding Constant-Size Subgraphs" in Proceedings of the 14th Conference on Computability in Europe (CiE '18), Springer International Publishing, 2018. pp. 183–193.

DOI

10.1007/978-3-319-94418-0_19

Weblink

https://arxiv.org/abs/1611.03739

J. Luo, H. Molter, A. Nichterlein and R. Niedermeier, "Parameterized Dynamic Cluster Editing" in Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '18), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. pp. 46:1–46:15.

DOI

10.4230/LIPICS.FSTTCS.2018.46

Weblink

https://arxiv.org/abs/1810.06625

V. Froese, I. Kanj, A. Nichterlein and R. Niedermeier, "Finding Points in General Position" , International Journal of Computational Geometry & Applications, vol. 27, no. 4, pp. 277–296, 2017.

DOI

10.1142/S021819591750008X

Weblink

http://arxiv.org/abs/1508.01097

R. Bevern, R. Bredereck, M. Chopin, S. Hartung, F. Hüffner, A. Nichterlein and O. Suchý, "Fixed-parameter algorithms for DAG Partitioning" , Discrete Applied Mathematics, vol. 220, pp. 134–160, 2017.

DOI

10.1016/J.DAM.2016.12.002

Weblink

https://arxiv.org/abs/1611.08809

R. Bredereck, V. Froese, M. Koseler, M. G. Millani, A. Nichterlein and R. Niedermeier, "A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems" in Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC '16), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. pp. 10:1–10:14.

DOI

10.4230/LIPIcs.IPEC.2016.10

Weblink

http://arxiv.org/abs/1604.06302

M. Bentert, R. Bevern, A. Nichterlein and R. Niedermeier, "Parameterized algorithms for power-efficient connected symmetric wireless sensor networks" in Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS '17), Springer International Publishing, 2017. pp. 26–40.

DOI

10.1007/978-3-319-72751-6 _ 3

Weblink

https://arxiv.org/abs/1706.03177

M. Bentert, T. Fluschnik, A. Nichterlein and R. Niedermeier, "Parameterized Aspects of Triangle Enumeration" in Proceedings of the 21st Symposium on Fundamentals of Computation Theory (FCT '17), Springer International Publishing, 2017. pp. 96–110.

DOI

10.1007/978-3-662-55751-8_9

Weblink

https://arxiv.org/abs/1702.06548

G. B. Mertzios, A. Nichterlein and R. Niedermeier, "The Power of Linear-Time Data Reduction for Maximum Matching" in Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS '17), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. pp. 46:1–46:14.

DOI

10.4230/LIPICS.MFCS.2017.46

Weblink

http://fpt.akt.tu-berlin.de/publications/fpt-in-p-matching-MFCS-2017-final.pdf

T. Fluschnik, C. Komusiewicz, G. B. Mertzios, A. Nichterlein, R. Niedermeier and N. Talmon, "When can Graph Hyperbolicity be computed in Linear Time?" in Proceedings of the 15th Workshop on Algorithms and Data Structures (WADS '17), Springer International Publishing, 2017. pp. 397–408.

DOI

10.1007/978-3-319-62127-2_34

Weblink

https://arxiv.org/abs/1702.06503

V. Froese, I. Kanj, A. Nichterlein and R. Niedermeier, "Finding Points in General Position" in Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG '16), 2016. pp. 7–14.

Weblink

http://arxiv.org/abs/1508.01097

T. Fluschnik, D. Hermelin, A. Nichterlein and R. Niedermeier, "Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems" in Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP '16), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. pp. 25:1–25:14.

DOI

10.4230/LIPICS.ICALP.2016.25

Weblink

http://arxiv.org/abs/1512.00333

R. Bredereck, J. Chen, A. Nichterlein, P. Faliszewski and R. Niedermeier, "Prices Matter for the Parameterized Complexity of Shift Bribery" , Information and Computation, vol. 251, pp. 140–164, 2016.

DOI

10.1016/j.ic.2016.08.003

Weblink

https://arxiv.org/abs/1502.01253

C. Bazgan, R. Bredereck, S. Hartung, A. Nichterlein and G. J. Woeginger, "Finding large degree-anonymous subgraphs is hard" , Theoretical Computer Science, vol. 622, pp. 90–110, 2016.

DOI

10.1016/j.tcs.2016.02.004

Weblink

http://fpt.akt.tu-berlin.de/publications/anon-deletion-TCS-2016.pdf

V. Froese, A. Nichterlein and R. Niedermeier, "Win-Win Kernelization for Degree Sequence Completion Problems" , Journal of Computer and System Sciences, vol. 82, no. 6, pp. 1100–1111, 2016.

DOI

10.1016/J.JCSS.2016.03.009

Weblink

http://arxiv.org/abs/1404.5432

S. Hartung, A. Nichterlein, R. Niedermeier and O. Suchý, "A Refined Complexity Analysis of Degree Anonymization on Graphs" , Information and Computation, vol. 243, pp. 249–262, 2015.

DOI

10.1016/j.ic.2014.12.017

Weblink

http://fpt.akt.tu-berlin.de/publications/graph_anon_kernel_iac14.pdf

S. Hartung and A. Nichterlein, "NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs" , SIAM Journal on Discrete Mathematics, vol. 29, no. 4, pp. 1931-1960, 2015.

DOI

10.1137/130935756

Weblink

http://fpt.akt.tu-berlin.de/publications/dag_realization_sidma.pdf

S. Hartung, C. Komusiewicz, A. Nichterlein and O. Suchý, "On structural parameterizations for the 2-club problem" , Discrete Applied Mathematics, vol. 185, pp. 79-92, 2015.

DOI

10.1016/j.dam.2014.11.026

Weblink

http://fpt.akt.tu-berlin.de/publications/sclubHardness_journal.pdf

S. Hartung, C. Komusiewicz and A. Nichterlein, "Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs" , Journal of Graph Algorithms and Applications, vol. 19, no. 1, pp. 155–190, 2015.

DOI

10.7155/jgaa.00352

Weblink

http://fpt.akt.tu-berlin.de/publications/sclubImplementation_JGAA_2015.pdf

R. Bredereck, V. Froese, S. Hartung, A. Nichterlein, R. Niedermeier and N. Talmon, "The Complexity of Degree Anonymization by Vertex Addition" , Theoretical Computer Science, vol. 607, no. 1, pp. 16–34, 2015. Elsevier.

DOI

10.1016/J.TCS.2015.07.004

Weblink

http://fpt.akt.tu-berlin.de/publications/TheComplexityofDegreeAnonymization-TCS.pdf

R. Bredereck, T. Köhler, A. Nichterlein, R. Niedermeier and G. Philip, "Using Patterns to Form Homogeneous Teams" , Algorithmica, vol. 71, no. 2, pp. 517-538, 2015. Springer.

DOI

10.1007/s00453-013-9821-0

Weblink

http://fpt.akt.tu-berlin.de/publications/homteam.pdf

C. Bazgan, A. Nichterlein and R. Niedermeier, "A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths" in Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC'15), Springer, 2015. pp. 47–60.

DOI

10.1007/978-3-319-18173-8_3

Weblink

http://fpt.akt.tu-berlin.de/publications/vital_edges_shortest_path.pdf

F. Hüffner, C. Komusiewicz and A. Nichterlein, "Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes" in Proceedings of the Algorithms and Data Structures Symposium (WADS'15), Springer, 2015. pp. 410–421.

DOI

10.1007/978-3-319-21840-3_34

Weblink

http://fpt.akt.tu-berlin.de/publications/clique-edit-wads15.pdf

C. Komusiewicz, A. Nichterlein and R. Niedermeier, "Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics" in Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG '15), Springer, 2015.

Weblink

https://fpt.akt.tu-berlin.de/publications/graphmod-wg15.pdf

A. Nichterlein, "Degree-Constrained Editing of Small-Degree Graphs", PhD Thesis, TU Berlin, Dez. 2014.

Weblink

https://depositonce.tu-berlin.de/bitstream/11303/4712/1/nichterlein_andre.pdf

Datei

https://depositonce.tu-berlin.de/bitstream/11303/4712/1/nichterlein_andre.pdf

C. Bazgan and A. Nichterlein, "Parameterized Inapproximability of Degree Anonymization" in Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC '14), Springer, 2014. pp. 75–84.

DOI

10.1007/978-3-319-13524-3_7

Weblink

http://fpt.akt.tu-berlin.de/publications/graph_anon_fpt_approx_ipec14.pdf

V. Froese, A. Nichterlein and R. Niedermeier, "Win-Win Kernelization for Degree Sequence Completion Problems" in Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '14), Springer, 2014. pp. 194–205.

DOI

10.1007/978-3-319-08404-6_17

Weblink

http://fpt.akt.tu-berlin.de/publications/winwin_swat.pdf

R. Bredereck, V. Froese, S. Hartung, A. Nichterlein, R. Niedermeier and N. Talmon, "The Complexity of Degree Anonymization by Vertex Addition" in Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM '14), Springer, 2014. pp. 44–55.

DOI

10.1007/978-3-319-07956-1_5

Weblink

http://fpt.akt.tu-berlin.de/publications/aaim-12.pdf

C. Bazgan, M. Chopin, A. Nichterlein and F. Sikora, "Parameterized Inapproximability of Target Set Selection and Generalizations" in Proceedings of the 10th International Conference on Computability in Europe (CiE' 14), Springer, 2014. pp. 11–20.

DOI

10.1007/978-3-319-08019-2_2

Weblink

http://fpt.akt.tu-berlin.de/publications/tssCiE14.pdf

R. Bredereck, J. Chen, A. Nichterlein, P. Faliszewski and R. Niedermeier, "Prices Matter for the Parameterized Complexity of Shift Bribery" in Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI '14), 2014. pp. 552–558.

Weblink

http://fpt.akt.tu-berlin.de/publications/sb_BrChFaNiNi.pdf

S. Hartung, C. Hoffmann and A. Nichterlein, "Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks" in Proceedings of the 13th Symposium on Experimental Algorithms (SEA' 14), Springer, 2014. pp. 376–387.

DOI

10.1007/978-3-319-07959-2_32

Weblink

http://fpt.akt.tu-berlin.de/publications/graph_anon_impl_sea14.pdf

R. Bredereck, A. Nichterlein, R. Niedermeier and G. Philip, "The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization" , Data Mining and Knowledge Discovery, vol. 28, no. 1, pp. 65–91, 2014. Springer.

DOI

10.1007/s10618-012-0293-7

Weblink

http://fpt.akt.tu-berlin.de/publications/The_Effect_of_Homogeneity_on_the_Computational_Complexity_of_Combinatorial_Data_Anonymization_DataMinKnowlDis.pdf

C. Bazgan, M. Chopin, A. Nichterlein and F. Sikora, "Parameterized Inapproximability of Target Set Selection and Generalizations" , Computability, vol. 3, no. 2, pp. 135–145, 2014.

DOI

10.3233/COM-140030

Weblink

http://fpt.akt.tu-berlin.de/publications/parameterized_inapproximability_of_target_set_selection_and_generalizations.pdf

C. Bazgan, M. Chopin, A. Nichterlein and F. Sikora, "Parameterized approximability of maximizing the spread of influence in networks" , Journal of Discrete Algorithms, vol. 27, pp. 54-65, 2014.

DOI

10.1016/j.jda.2014.05.001

Weblink

http://fpt.akt.tu-berlin.de/publications/Parameterized_approximability_of_maximizing_the_spread_of_influence_in_networks.pdf

R. Bevern, S. Hartung, A. Nichterlein and M. Sorge, "Constant-factor approximations for Capacitated Arc Routing without triangle inequality" , Operations Research Letters, vol. 4, no. 4, pp. 290–292, 2014.

DOI

10.1016/j.orl.2014.05.002

Weblink

http://arxiv.org/abs/1404.3660

M. Chopin, A. Nichterlein, R. Niedermeier and M. Weller, "Constant Thresholds Can Make Target Set Selection Tractable" , Theory of Computing Systems, vol. 55, no. 1, pp. 61–83, 2014. Springer.

DOI

10.1007/s00224-013-9499-3

Weblink

http://fpt.akt.tu-berlin.de/publications/tssConstThres_full.pdf

R. Bredereck, S. Hartung, A. Nichterlein and G. Woeginger, "The complexity of finding a large subgraph under anonymity constraints" in Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC '13), Springer, 2013. pp. 152–162.

DOI

10.1007/978-3-642-45030-3_15

Weblink

http://fpt.akt.tu-berlin.de/publications/graph_anon_isaac.pdf

R. Bredereck, A. Nichterlein and R. Niedermeier, "Pattern-Guided k-Anonymity" in Proceedings of the Joint Conference of the 7th International Frontiers of Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM '13), Springer, 2013. pp. 350-361.

DOI

10.1007/978-3-642-38756-2_35

Weblink

http://fpt.akt.tu-berlin.de/publications/Pattern-Guided_k-Anonymity-FAW-AAIM.pdf

R. Bevern, R. Bredereck, M. Chopin, S. Hartung, F. Hüffner, A. Nichterlein and O. Suchý, "Parameterized Complexity of DAG Partitioning" in Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC '13), Springer, 2013. pp. 49-60.

DOI

10.1007/978-3-642-38233-8_5

Weblink

http://fpt.akt.tu-berlin.de/publications/dagPartitioning.pdf

C. Bazgan, M. Chopin, A. Nichterlein and F. Sikora, "Parameterized Approximability of Maximizing the Spread of Influence in Networks" in Proceedings of the 9th Annual International Computing and Combinatorics Conference (COCOON'13), Springer, 2013. pp. 543-554.

DOI

10.1007/978-3-642-38768-5_48

Weblink

http://fpt.akt.tu-berlin.de/publications/Parameterized_Approximability_of_Maximizing_the_Spread_of_Influence_in_Networks.pdf

S. Hartung and A. Nichterlein, "On the Parameterized and Approximation Hardness of Metric Dimension" in Proceedings of the 28th IEEE Conference on Computational Complexity (CCC '13), IEEE, 2013. pp. 266-276.

DOI

10.1109/CCC.2013.36

Weblink

http://fpt.akt.tu-berlin.de/publications/metricDimension.pdf

S. Hartung, C. Komusiewicz and A. Nichterlein, "On Structural Parameterizations for the 2-Club Problem" in Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM '13), Springer, 2013. pp. 233-243.

DOI

10.1007/978-3-642-35843-2_21

Weblink

http://fpt.akt.tu-berlin.de/publications/sclubHardness.pdf

S. Hartung, A. Nichterlein, R. Niedermeier and O. Suchý, "A Refined Complexity Analysis of Degree Anonymization on Graphs" in Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP '13), Springer, 2013. pp. 594-606.

DOI

10.1007/978-3-642-39212-2_52

Weblink

http://fpt.akt.tu-berlin.de/publications/graph_anonymization.pdf

R. Bredereck, A. Nichterlein and R. Niedermeier, "Pattern-Guided k-Anonymity" , Algorithms, vol. 6, no. 4, pp. 678–701, 2013.

DOI

10.3390/a6040678

Weblink

http://fpt.akt.tu-berlin.de/publications/pattern_guided_k-anonymity.pdf

A. Nichterlein, R. Niedermeier, J. Uhlmann and M. Weller, "On tractable cases of Target Set Selection" , Social Network Analysis and Mining, vol. 3, no. 2, pp. 233-256, 2013. Springer.

DOI

10.1007/S13278-012-0067-7

Weblink

http://www.akt.tu-berlin.de/fileadmin/fg34/publications-akt/tss-long.pdf

M. Chopin, A. Nichterlein, R. Niedermeier and M. Weller, "Constant Thresholds Can Make Target Set Selection Tractable" in Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg '12), 2012. pp. 120-133.

DOI

10.1007/978-3-642-34862-4_9

Weblink

http://fpt.akt.tu-berlin.de/publications/tssConstThres.pdf

S. Hartung and A. Nichterlein, "NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs" in Proceedings of the 8th International Conference on Computability in Europe 2012 (CiE 2012), Springer, 2012. pp. 283-292.

DOI

10.1007/978-3-642-30870-3_29

Weblink

http://fpt.akt.tu-berlin.de/publications/dag_realization.pdf

S. Hartung, C. Komusiewicz and A. Nichterlein, "Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs" in Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC'12), Springer, 2012. pp. 231-241.

DOI

10.1007/978-3-642-33293-7_22

Weblink

http://fpt.akt.tu-berlin.de/publications/sclubImplementation.pdf

A. Nichterlein, M. Dom and R. Niedermeier, "Aspects of a Multivariate Complexity Analysis for Rectangle Tiling" , Operation Research Letters, vol. 39, no. 5, pp. 346-351, 2011. Elsevier.

DOI

10.1016/J.ORL.2011.06.001

Weblink

http://fpt.akt.tu-berlin.de/publications/tiling.pdf

R. Bredereck, A. Nichterlein, R. Niedermeier and G. Philip, "Pattern-Guided Data Anonymization and Clustering" in Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS '11), Springer, 2011. pp. 182-193.

DOI

10.1007/978-3-642-22993-0_19

Weblink

http://fpt.akt.tu-berlin.de/publications/Pattern-Guided_Data_Anonymization_and_Clustering-MFCS.pdf

R. Bredereck, A. Nichterlein, R. Niedermeier and G. Philip, "The Effect of Homogeneity on the Complexity of $k$-Anonymity" in Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT '11), Springer, 2011. pp. 53-64.

DOI

10.1007/978-3-642-22953-4_5

Weblink

http://fpt.akt.tu-berlin.de/publications/The_Effect_of_Homogeneity_on_the_Complexity_of_k-Anonymity-FCT.pdf

A. Nichterlein, R. Niedermeier, J. Uhlmann and M. Weller, "On Tractable Cases of Target Set Selection" in Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC '10), Part I, Springer, 2010. pp. 378–389.

DOI

10.1007/978-3-642-17517-6_34

Weblink

http://www.akt.tu-berlin.de/fileadmin/fg34/publications-akt/tss.pdf