×

Found 389 Documents (Results 1–100)

Newest Citations Relevance
Kammer, Frank; Meintrup, Johannes

Space-efficient graph coarsening with applications to succinct planar encodings. (English) Zbl 07911128

Bae, Sang Won (ed.) et al., 33rd international symposium on algorithms and computation (ISAAC 2022), Seoul, Korea, December 19–21, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 248, Article 62, 15 p. (2022).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI arXiv
Adams, Henry; Gibson, Leah; Pfaffinger, Jack

Lions and contamination, triangular grids, and Cheeger constants. (English) Zbl 1498.05184

Gasparovic, Ellen (ed.) et al., Research in computational topology 2. Proceedings of the second women in computational topology, WinCompTop, research collaboration workshop, Mathematical Sciences Institute, MSI, Australian National University, ANU, Canberra, Australia, July 1–5, 2019. Cham: Springer. Assoc. Women Math. Ser. 30, 191-210 (2022).
MSC:  05C57 91A43 91A24
Cite Review PDF
Full Text: DOI arXiv
De Berg, Mark; Kisfaludi-Bak, Sándor; Monemizadeh, Morteza; Theocharous, Leonidas

Clique-based separators for geometric intersection graphs. (English) Zbl 07788595

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 22, 15 p. (2021).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI
Swat, Sylwester

PACE solver description: finding elimination trees using ExTREEm – a heuristic solver for the treedepth decomposition problem. (English) Zbl 07764124

Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 33, 4 p. (2020).
MSC:  68Q25 68Q27 68Wxx
Cite Review PDF
Full Text: DOI
Blum, Johannes; Storandt, Sabine

Lower bounds and approximation algorithms for search space sizes in contraction hierarchies. (English) Zbl 07651159

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 20, 14 p. (2020).
MSC:  68Wxx
Cite Review PDF
Full Text: DOI
Conte, Alessio; Crescenzi, Pierluigi; Marino, Andrea; Punzi, Giulia

Enumeration of \(s\)-\(d\) separators in DAGs with application to reliability analysis in temporal graphs. (English) Zbl 07559396

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 25, 14 p. (2020).
MSC:  68Qxx
Cite Review PDF
Full Text: DOI
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav

Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS. (English) Zbl 1534.68182

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 523-537 (2019).
MSC:  68R10 68Q27
Cite Review PDF
Full Text: DOI
Biniaz, Ahmad; Cabello, Sergio; Carmi, Paz; De Carufel, Jean-Lou; Maheshwari, Anil; Mehrabi, Saeed; Smid, Michiel

On the minimum consistent subset problem. (English) Zbl 1498.68356

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 155-167 (2019).
MSC:  68U05 68P05 68W40
Cite Review PDF
Full Text: DOI arXiv
Manurangsi, Pasin; Trevisan, Luca

Mildly exponential time approximation algorithms for vertex cover, balanced separator and uniform sparsest cut. (English) Zbl 1521.68255

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 20, 17 p. (2018).
MSC:  68W25 68R10 68W40
Cite Review PDF
Full Text: DOI
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav

Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems. (English) Zbl 1499.68395

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 1, 15 p. (2018).
MSC:  68W25 05C22 05C85 68R10 68W20
Cite Review PDF
Full Text: DOI arXiv
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; Zanden, Tom C. van der

A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. (English) Zbl 1427.68353

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 574-586 (2018).
MSC:  68W05 05C62 05C69 05C83 05C85 68Q17 68R10
Cite Review PDF
Full Text: DOI arXiv
Ceria, Michela; Mora, Teo; Visconti, Andrea

Efficient computation of squarefree separator polynomials. (English) Zbl 1395.68344

Davenport, James H. (ed.) et al., Mathematical software – ICMS 2018. 6th international conference, South Bend, IN, USA, July 24–27, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-96417-1/pbk; 978-3-319-96418-8/ebook). Lecture Notes in Computer Science 10931, 98-104 (2018).
MSC:  68W30 68P05
Cite Review PDF
Full Text: DOI Link
Sarfati, Marc; Queudot, Marc; Mancel, Catherine; Meurs, Marie-Jean

Knowledge discovery in graphs through vertex separation. (English) Zbl 1454.68131

Mouhoub, Malek (ed.) et al., Advances in artificial intelligence. 30th Canadian conference on artificial intelligence, Canadian AI 2017, Edmonton, AB, Canada, May 16–19, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10233, 203-214 (2017).
MSC:  68T05 68R10 68T30
Cite Review PDF
Full Text: DOI Link
van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej

Finding secluded places of special interest in graphs. (English) Zbl 1398.68408

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 5, 16 p. (2017).
MSC:  68R10 68Q25
Cite Review PDF
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software