×

Found 238 Documents (Results 1–100)

Detours in directed graphs. (English) Zbl 07836596

Berenbrink, Petra (ed.) et al., 39th international symposium on theoretical aspects of computer science, STACS 2022, Marseille, France, virtual conference, March 15–18, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 219, Article 29, 16 p. (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

An experimental study of ILP formulations for the longest induced path problem. (English) Zbl 1458.90539

Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12176, 89-101 (2020).
MSC:  90C27 90C10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Going far from degeneracy. (English) Zbl 07525484

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 47, 14 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameter synthesis algorithms for parametric interval Markov chains. (English) Zbl 1508.68256

Baier, Christel (ed.) et al., Formal techniques for distributed objects, components, and systems. 38th IFIP WG 6.1 international conference, FORTE 2018, held as part of the 13th international federated conference on distributed computing techniques, DisCoTec 2018, Madrid, Spain, June 18–21, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10854, 121-140 (2018).
MSC:  68Q87 60J10
PDFBibTeX XMLCite
Full Text: DOI HAL

Algorithmic framework for approximate matching under bounded edits with applications to sequence analysis. (English) Zbl 1507.92003

Raphael, Benjamin J. (ed.), Research in computational molecular biology. 22nd annual international conference, RECOMB 2018, Paris, France, April 21–24, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10812, 211-224 (2018).
MSC:  92-08 92D20
PDFBibTeX XMLCite
Full Text: DOI

Longest common factor after one edit operation. (English) Zbl 1454.68196

Fici, Gabriele (ed.) et al., String processing and information retrieval. 24th international symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10508, 14-26 (2017).
MSC:  68W32 68P05
PDFBibTeX XMLCite
Full Text: DOI

Finding detours is fixed-parameter tractable. (English) Zbl 1441.68104

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 54, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Transversals of longest paths. (English) Zbl 1383.05073

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 135-140 (2017).
MSC:  05C12 05C38 05C40
PDFBibTeX XMLCite
Full Text: DOI arXiv

A streaming algorithm for the undirected longest path problem. (English) Zbl 1397.68143

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 56, 17 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

On almost Monge all scores matrices. (English) Zbl 1380.68465

Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 17, 12 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs. (English) Zbl 1378.68076

Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 102-113 (2015).
MSC:  68Q25 05C85
PDFBibTeX XMLCite
Full Text: DOI

Computing and counting longest paths on circular-arc graphs in polynomial time. (English) Zbl 1268.05209

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 219-224 (2011).
MSC:  05C85 05C38 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field