×

Found 52 Documents (Results 1–52)

Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices. (English) Zbl 1477.68467

Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 18, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal matroid partitioning problems. (English) Zbl 1457.68127

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

Proportional cost buyback problem with weight bounds. (English) Zbl 1473.68218

Lu, Zaixin (ed.) et al., Combinatorial optimization and applications. 9th international conference, COCOA 2015, Houston, TX, USA, December 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9486, 794-808 (2015).
MSC:  68W27 05B35 90C27
PDFBibTeX XMLCite
Full Text: DOI

Parameterized edge Hamiltonicity. (English) Zbl 1417.05115

Kratsch, Dieter (ed.) et al., Graph-theoretic concepts in computer science. 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25–27, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8747, 348-359 (2014).
MSC:  05C45 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Deterministic random walks on finite graphs. (English) Zbl 1430.05118

Hwang, Hsien-Kuei (ed.) et al., Proceedings of the 9th workshop on analytic algorithmics and combinatorics (ANALCO ’12), Kyoto, Japan, January 16, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 16-25 (2012).
MSC:  05C81
PDFBibTeX XMLCite
Full Text: DOI

Robust independence systems. (English) Zbl 1333.05304

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 367-378 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Robust matchings and matroid intersections. (English) Zbl 1287.05114

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15780-6/pbk). Lecture Notes in Computer Science 6347, 123-134 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Posi-modular systems with modulotone requirements under permutation constraints. (English) Zbl 1202.68498

Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 473-482 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs. (English) Zbl 1256.68150

Fiat, Amos (ed.) et al., Algorithms – ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7–9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 143-154 (2009).
PDFBibTeX XMLCite
Full Text: DOI Link

On the fractional chromatic number of monotone self-dual Boolean functions. (English) Zbl 1214.06004

Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. First annual international workshop, FAW 2007, Lanzhou, China, August 1–3, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73813-8). Lecture Notes in Computer Science 4613, 148-159 (2007).
MSC:  06E30 05C15 05C65
PDFBibTeX XMLCite
Full Text: DOI

On the Boolean connectivity problem for Horn relations. (English) Zbl 1214.03026

Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing – SAT 2007. 10th international conference, Lisbon, Portugal, May 28–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 187-200 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Generating minimal \(k\)-vertex connected spanning subgraphs. (English) Zbl 1206.05094

Lin, Guohui (ed.), Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73544-1/pbk). Lecture Notes in Computer Science 4598, 222-231 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Minimum cost source location problems with flow requirements. (English) Zbl 1145.90419

Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 769-780 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Minimum transversals in posi-modular systems. (English) Zbl 1131.05321

Azar, Yossi (ed.) et al., Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 576-587 (2006).
MSC:  05D15 05C65 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Enumerating spanning and connected subsets in graphs and matroids. (English) Zbl 1131.05305

Azar, Yossi (ed.) et al., Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 444-455 (2006).
MSC:  05C30 05B35 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Generating cut conjunctions and bridge avoiding extensions in graphs. (English) Zbl 1147.68609

Deng, Xiaotie (ed.) et al., Algorithms and computation. 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30935-7/pbk). Lecture Notes in Computer Science 3827, 156-165 (2005).
PDFBibTeX XMLCite
Full Text: DOI

New algorithms for enumerating all maximal cliques. (English) Zbl 1095.68626

Hagerup, Torben (ed.) et al., Algorithm theory – SWAT 2004. 9th Scandinavian workshop on algorithm theory, Humlebæk, Denmark, July 8–10, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22339-8/pbk). Lecture Notes in Computer Science 3111, 260-272 (2004).
PDFBibTeX XMLCite
Full Text: DOI

Generating paths and cuts in multi-pole (di)graphs. (English) Zbl 1096.68117

Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 298-309 (2004).
PDFBibTeX XMLCite
Full Text: DOI

Minimum edge ranking spanning trees of threshold graphs. (English) Zbl 1019.68079

Bose, Prosenjit (ed.) et al., Algorithms and computation. 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2518, 428-440 (2002).
MSC:  68R10 68Q25 05C85
PDFBibTeX XMLCite
Full Text: Link

Generating partial and multiple transversals of a hypergraph. (English) Zbl 0973.68182

Montanari, Ugo (ed.) et al., Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1853, 588-599 (2000).
PDFBibTeX XMLCite

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field

Software