×

Found 225 Documents (Results 1–100)

100
MathJax

Parameterized complexity of multi-node hubs. (English) Zbl 07378594

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 8, 14 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

A faster tree-decomposition based algorithm for counting linear extensions. (English) Zbl 07378591

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 5, 13 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Balanced judicious bipartition is fixed-parameter tractable. (English) Zbl 07278112

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 40, 15 p. (2018).
MSC:  68N30 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Minor-matching hypertree width. (English) Zbl 1403.05041

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 219-233 (2018).
MSC:  05C12 05C65 05C05
PDF BibTeX XML Cite
Full Text: arXiv Link

Optimizing tree decompositions in MSO. (English) Zbl 1402.68140

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 15, 13 p. (2017).
MSC:  68R10 03B15 03D05 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Turbocharging treewidth heuristics. (English) Zbl 1398.68490

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 13, 13 p. (2017).
MSC:  68T20 68Q17 68Q25
PDF BibTeX XML Cite
Full Text: DOI

Lexico-minimum replica placement in multitrees. (English) Zbl 1474.68066

Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 10628, 122-137 (2017).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Definability equals recognizability for graphs of bounded treewidth. (English) Zbl 1394.03062

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 407-416 (2016).
MSC:  03D05 03B15 05C75
PDF BibTeX XML Cite
Full Text: DOI arXiv

On space efficiency of algorithms working on structural decompositions of graphs. (English) Zbl 1388.68133

Ollinger, Nicolas (ed.) et al., 33rd symposium on theoretical aspects of computer science, STACS 2016, Orléans, France, February 17–20, 2016. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-001-9). LIPIcs – Leibniz International Proceedings in Informatics 47, Article 57, 15 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Context-free graph properties via definable decompositions. (English) Zbl 1370.03049

Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 17, 16 p. (2016).
MSC:  03C13 03B15 03D05
PDF BibTeX XML Cite
Full Text: DOI

Exact algorithms for weighted coloring in special classes of tree and cactus graphs. (English) Zbl 1478.68215

Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9843, 347-358 (2016).
PDF BibTeX XML Cite
Full Text: DOI

Minimum size tree-decompositions. (English) Zbl 1347.05158

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 21-27, electronic only (2015).
PDF BibTeX XML Cite
Full Text: DOI Link

On minimum bisection and related partition problems in graphs with bounded tree width. (English) Zbl 1346.05229

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 481-488, electronic only (2015).
MSC:  05C70 05C12
PDF BibTeX XML Cite
Full Text: DOI

Chordal editing is fixed-parameter tractable. (English) Zbl 1359.05119

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 214-225 (2014).
MSC:  05C85 68Q25
PDF BibTeX XML Cite
Full Text: DOI

Algorithms for the maximum weight connected \(k\)-induced subgraph problem. (English) Zbl 1431.90159

Zhang, Zhao (ed.) et al., Combinatorial optimization and applications. 8th international conference, COCOA 2014, Wailea, Maui, HI, USA, December 19–21, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8881, 268-282 (2014).
MSC:  90C35 90C10
PDF BibTeX XML Cite
Full Text: DOI

Minimum bisection is fixed parameter tractable. (English) Zbl 1315.05134

Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 323-332 (2014).
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Finding maximum common biconnected subgraphs in series-parallel graphs. (English) Zbl 1426.68129

Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II. Berlin: Springer. Lect. Notes Comput. Sci. 8635, 505-516 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Space saving by dynamic algebraization. (English) Zbl 1408.68073

Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. 9th international computer science symposium in Russia, CSR 2014, Moscow, Russia, June 7–11, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8476, 375-388 (2014).
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Exploiting separators for guiding VNS. (English) Zbl 1268.68152

Sifaleras, Angelo (ed.) et al., Selected papers of the 28th EURO mini conference (MEC XXVIII) on variable neighborhood search, Herceg Novi, Mentenegro, October 4–7, 2012. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 39, 265-272 (2012).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI HAL

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software