×

Found 72 Documents (Results 1–72)

The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing. (English) Zbl 07803604

Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 26, 18 p. (2021).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

On 2-clubs in graph-based data clustering: theory and algorithm engineering. (English) Zbl 07667132

Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 216-230 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Towards classifying the polynomial-time solvability of temporal betweenness centrality. (English) Zbl 07538579

Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 219-231 (2021).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

An adaptive version of Brandes’ algorithm for betweenness centrality. (English) Zbl 07561390

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 36, 13 p. (2018).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterized dynamic cluster editing. (English) Zbl 1528.68308

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 46, 15 p. (2018).
MSC:  68R10 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Data reduction for maximum matching on real-world graphs: theory and experiments. (English) Zbl 1524.68234

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 53, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Kernelization lower bounds for finding constant-size subgraphs. (English) Zbl 1509.68109

Manea, Florin (ed.) et al., Sailing routes in the world of computation. 14th conference on computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10936, 183-193 (2018).
MSC:  68Q27 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

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).
PDFBibTeX XMLCite
Full Text: DOI

The power of linear-time data reduction for maximum matching. (English) Zbl 1441.68192

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 46, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized aspects of triangle enumeration. (English) Zbl 1495.68162

Klasing, Ralf (ed.) et al., Fundamentals of computation theory. 21st international symposium, FCT 2017, Bordeaux, France, September 11–13, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10472, 96-110 (2017).
MSC:  68R10 05C30 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

When can graph hyperbolicity be computed in linear time? (English) Zbl 1491.68143

Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 397-408 (2017).
MSC:  68R10 68Q25 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

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
Full Text: DOI

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

Parameterized inapproximability of degree anonymization. (English) Zbl 1456.68062

Cygan, Marek (ed.) et al., Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10–12, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8894, 75-84 (2014).
MSC:  68Q27 05C07 68R10
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI arXiv

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
Full Text: DOI

The complexity of finding a large subgraph under anonymity constraints. (English) Zbl 1329.05276

Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 152-162 (2013).
MSC:  05C85 68W30
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

Parameterized approximability of maximizing the spread of influence in networks. (English) Zbl 1382.68329

Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 19th international conference, COCOON 2013, Hangzhou, China, June 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38767-8/pbk). Lecture Notes in Computer Science 7936, 543-554 (2013).
MSC:  68W25 68R10 91D30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized complexity of DAG partitioning. (English) Zbl 1382.68127

Spirakis, Paul G. (ed.) et al., Algorithms and complexity. 8th international conference, CIAC 2013, Barcelona, Spain, May 22–24, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38232-1/pbk). Lecture Notes in Computer Science 7878, 49-60 (2013).
MSC:  68Q25 68R10
PDFBibTeX XMLCite
Full Text: DOI

Constant thresholds can make target set selection tractable. (English) Zbl 1319.68108

Even, Guy (ed.) et al., Design and analysis of algorithms. First Mediterranean conference on algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3–5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34861-7/pbk). Lecture Notes in Computer Science 7659, 120-133 (2012).
MSC:  68Q25 05C69 91D30
PDFBibTeX XMLCite
Full Text: DOI Link

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software