×

Found 350 Documents (Results 1–100)

Approximation algorithms for the directed path partition problems. (English) Zbl 1528.68280

Chen, Jing (ed.) et al., Frontiers of algorithmics. International joint conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12874, 23-36 (2022).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithmic aspects of small quasi-kernels. (English) Zbl 07682423

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 370-382 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized complexity of weighted multicut in trees. (English) Zbl 07682415

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 257-270 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Twin-width is linear in the poset width. (English) Zbl 07803584

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 6, 13 p. (2021).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Lexicographic product of digraphs and related boundary-type sets. (English) Zbl 07497534

Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 234-246 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Upward point set embeddings of paths and trees. (English) Zbl 07405965

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 234-246 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Exact and approximate digraph bandwidth. (English) Zbl 07650315

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 18, 15 p. (2019).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs. (English) Zbl 1516.68069

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 28, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of finding internally vertex-disjoint long directed paths. (English) Zbl 1485.68171

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 66-79 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Directed path-width of sequence digraphs. (English) Zbl 1521.68099

Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11346, 79-93 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Cut sparsifiers for balanced digraphs. (English) Zbl 1522.05164

Epstein, Leah (ed.) et al., Approximation and online algorithms. 16th international workshop, WAOA 2018, Helsinki, Finland, August 23–24, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11312, 277-294 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Dyck-Eulerian digraphs. (English) Zbl 1397.05094

Garijo, Delia (ed.) et al., Discrete mathematics days 2018. Extended abstracts of the 11th “Jornadas de matemática discreta y algorítmica” (JMDA), Sevilla, Spain, June 27–29, 2018. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 68, 239-244 (2018).
MSC:  05C45 05C20 68R15
PDFBibTeX XMLCite
Full Text: DOI

Settlement fund circulation problem. (English) Zbl 1457.91264

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 46, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. (English) Zbl 1441.68161

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 70, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Attainable values of reset thresholds. (English) Zbl 1441.68123

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 40, 14 p. (2017).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Diclique clustering in a directed random graph. (English) Zbl 1398.68388

Bonato, Anthony (ed.) et al., Algorithms and models for the web graph. 13th international workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-49786-0/pbk; 978-3-319-49787-7/ebook). Lecture Notes in Computer Science 10088, 22-33 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Černý conjecture for edge-colored digraphs with few junctions. (English) Zbl 1356.05051

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 115-120 (2016).
MSC:  05C15 05C20 68Q45
PDFBibTeX XMLCite
Full Text: DOI

Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism. (English) Zbl 1378.68084

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, 78-89 (2015).
MSC:  68Q25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. (English) Zbl 1354.68302

Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 197-208 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subgraphs satisfying MSO properties on \(z\)-topologically orderable digraphs. (English) Zbl 1406.68048

Gutin, Gregory (ed.) et al., Parameterized and exact computation. 8th international symposium, IPEC 2013, Sophia Antipolis, France, September 4–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03897-1/pbk). Lecture Notes in Computer Science 8246, 123-136 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software