×

Found 99 Documents (Results 1–99)

Parameterizing role coloring on forests. (English) Zbl 1490.68163

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 308-321 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Structural parameterizations with modulator oblivion. (English) Zbl 07764110

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 19, 18 p. (2020).
MSC:  68Q25 68Q27 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Recognizing \(k\)-clique extendible orderings. (English) Zbl 1524.68229

Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 274-285 (2020).
PDFBibTeX XMLCite
Full Text: DOI

A framework for in-place graph algorithms. (English) Zbl 1522.68389

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 13, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A polynomial sized kernel for tracking paths problem. (English) Zbl 1436.68143

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, 94-107 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Maintaining chordal graphs dynamically: improved upper and lower bounds. (English) Zbl 1484.68148

Fomin, Fedor V. (ed.) et al., Computer science – theory and applications. 13th international computer science symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10846, 29-40 (2018).
MSC:  68R10 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters. (English) Zbl 1489.68197

Xiao, Mingyu (ed.) et al., Frontiers in algorithmics. 11th international workshop, FAW 2017, Chengdu, China, June 23–25, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10336, 209-220 (2017).
PDFBibTeX XMLCite
Full Text: DOI

The complexity of finding (approximate sized) distance-\(d\) dominating set in tournaments. (English) Zbl 1494.68189

Xiao, Mingyu (ed.) et al., Frontiers in algorithmics. 11th international workshop, FAW 2017, Chengdu, China, June 23–25, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10336, 22-33 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Improved bounds for poset sorting in the forbidden-comparison regime. (English) Zbl 1485.68087

Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10156, 50-59 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Fréchet distance between a line and avatar point set. (English) Zbl 1390.68705

Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 32, 14 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Biconnectivity, chain decomposition and \(st\)-numbering using \(O(n)\) bits. (English) Zbl 1398.05193

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 22, 13 p. (2016).
MSC:  05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs. (English) Zbl 1398.68248

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 75, 13 p. (2016).
MSC:  68Q25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved space efficient algorithms for BFS, DFS and applications. (English) Zbl 1477.68197

Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 119-130 (2016).
MSC:  68R10 68P05 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Kernels for structural parameterizations of vertex cover – case of small degree modulators. (English) Zbl 1378.68089

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, 331-342 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Sorting and selection with equality comparisons. (English) Zbl 1451.68085

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 434-445 (2015).
MSC:  68P10 68P05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs. (English) Zbl 1465.68203

Xu, Dachuan (ed.) et al., Computing and combinatorics. 21st international conference, COCOON 2015, Beijing, China, August 4–6, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9198, 349-360 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Shortest reconfiguration paths in the solution space of Boolean formulas. (English) Zbl 1374.68246

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-47671-0/pbk; 978-3-662-47672-7/ebook). Lecture Notes in Computer Science 9134, 985-996 (2015).
MSC:  68Q25 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reconfiguration over tree decompositions. (English) Zbl 1456.68132

Cygan, Marek (ed.) et al., Parameterized and exact computation. 9th international symposium, IPEC 2014, Wroclaw, Poland, September 10–12, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8894, 246-257 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Faster, space-efficient selection algorithms in read-only memory for integers. (English) Zbl 1310.68218

Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 405-412 (2013).
MSC:  68W05 68P10 68Q05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On the parameterized complexity of reconfiguration problems. (English) Zbl 1350.68155

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, 281-294 (2013).
MSC:  68Q25 68Q17 90C35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. (English) Zbl 1270.68019

Lecture Notes in Computer Science 8066. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). xxviii, 363 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

Upper and lower bounds for weak backdoor set detection. (English) Zbl 1390.68353

Järvisalo, Matti (ed.) et al., Theory and applications of satisfiability testing – SAT 2013. 16th international conference, Helsinki, Finland, July 8–12, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-39070-8/pbk). Lecture Notes in Computer Science 7962, 394-402 (2013).
MSC:  68Q25 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

An FPT algorithm for tree deletion set. (English) Zbl 1379.68176

Ghosh, Subir Kumar (ed.) et al., WALCOM: algorithms and computation. 7th international workshop, WALCOM 2013, Kharagpur, India, February 14–16, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36064-0/pbk). Lecture Notes in Computer Science 7748, 286-297 (2013).
MSC:  68Q25 05C85
PDFBibTeX XMLCite
Full Text: DOI

Improved fixed-parameter algorithm for the minimum weight 3-SAT problem. (English) Zbl 1379.68177

Ghosh, Subir Kumar (ed.) et al., WALCOM: algorithms and computation. 7th international workshop, WALCOM 2013, Kharagpur, India, February 14–16, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36064-0/pbk). Lecture Notes in Computer Science 7748, 265-273 (2013).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI

Fixed-parameter tractability of satisfying beyond the number of variables. (English) Zbl 1273.68161

Cimatti, Alessandro (ed.) et al., Theory and applications of satisfiability testing – SAT 2012. 15th international conference, Trento, Italy, June 17–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31611-1/pbk). Lecture Notes in Computer Science 7317, 355-368 (2012).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI

Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows. (English) Zbl 1358.68146

Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 69-73 (2012).
PDFBibTeX XMLCite
Full Text: DOI

LP can be a cure for parameterized problems. (English) Zbl 1245.68111

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 338-349, electronic only (2012).
MSC:  68Q25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI

Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. (English) Zbl 1357.68073

Fomin, Fedor V. (ed.) et al., Algorithm theory – SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 364-375 (2012).
MSC:  68Q17 68Q25 68R10
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity of MaxSat above average. (English) Zbl 1353.68116

Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 184-194 (2012).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bidimensionality and EPTAS. (English) Zbl 1377.68324

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 748-759 (2011).
MSC:  68W25 05C85 68Q25
PDFBibTeX XMLCite
Full Text: Link

A polynomial kernel for Feedback Arc Set on bipartite tournaments. (English) Zbl 1350.68154

Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 333-343 (2011).
MSC:  68Q25 05C20
PDFBibTeX XMLCite
Full Text: DOI

Paths, flowers and vertex cover. (English) Zbl 1346.05287

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 382-393 (2011).
MSC:  05C85 05C70 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On parameterized independent feedback vertex set. (English) Zbl 1353.68135

Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 98-109 (2011).
MSC:  68Q25 05C69 05C85
PDFBibTeX XMLCite
Full Text: DOI

Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. (English) Zbl 1230.68104

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 251-262, electronic only (2010).
MSC:  68Q25 05C20 05C85
PDFBibTeX XMLCite
Full Text: DOI Link

A quartic kernel for pathwidth-one vertex deletion. (English) Zbl 1309.68100

Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 196-207 (2010).
MSC:  68Q25 05C38 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Solving minones-2-sat as fast as vertex cover. (English) Zbl 1287.68079

Hliněný, Petr (ed.) et al., Mathematical foundations of computer science 2010. 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23–27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15154-5/pbk). Lecture Notes in Computer Science 6281, 549-555 (2010).
MSC:  68Q25 68W25
PDFBibTeX XMLCite
Full Text: DOI

Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. (English) Zbl 1285.68207

Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 334-345 (2010).
PDFBibTeX XMLCite
Full Text: DOI

On the directed degree-preserving spanning tree problem. (English) Zbl 1273.68182

Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 276-287 (2009).
MSC:  68Q25 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI

Solving Dominating Set in larger classes of graphs: FPT algorithms and polynomial kernels. (English) Zbl 1256.68084

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, 694-705 (2009).
PDFBibTeX XMLCite
Full Text: DOI

The budgeted unique coverage problem and color-coding (extended abstract). (English) Zbl 1248.68257

Frid, Anna (ed.) et al., Computer science – theory and applications. Fourth international computer science symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03350-6/pbk). Lecture Notes in Computer Science 5675, 310-321 (2009).
MSC:  68Q25 68R05 68W20
PDFBibTeX XMLCite
Full Text: DOI

König deletion sets and vertex covers above the matching size. (English) Zbl 1183.68313

Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 836-847 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Parameterized algorithms for generalized domination. (English) Zbl 1168.05354

Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 116-126 (2008).
PDFBibTeX XMLCite
Full Text: DOI

The parameterized complexity of the unique coverage problem. (English) Zbl 1193.68139

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 621-631 (2007).
MSC:  68Q25 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI

The complexity of finding subgraphs whose matching number equals the vertex cover number. (English) Zbl 1193.05133

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 268-279 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Parameterizing MAX SNP problems above guaranteed values. (English) Zbl 1154.68430

Bodlaender, Hans L. (ed.) et al., Parameterized and exact computation. Second international workshop, IWPEC 2006, Zürich, Switzerland, September 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-39098-5/pbk). Lecture Notes in Computer Science 4169, 38-49 (2006).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI

Fast exponential algorithms for maximum \(r\)-regular induced subgraph problems. (English) Zbl 1177.68154

Arun-Kumar, S. (ed.) et al., FSTTCS 2006: Foundations of software technology and theoretical computer science. 26th international conference, Kolkata, India, December 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49994-7/pbk). Lecture Notes in Computer Science 4337, 139-151 (2006).
MSC:  68R10 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Triangles, 4-cycles and parameterized (in-)tractability. (English) Zbl 1142.68374

Arge, Lars (ed.) et al., Algorithm theory – SWAT 2006. 10th Scandinavian workshop on algorithm theory, Riga, Latvia, July 6–8, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-35753-7/pbk). Lecture Notes in Computer Science 4059, 304-315 (2006).
MSC:  68Q25 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI

Faster algorithms for feedback vertex set. (English) Zbl 1203.05155

Feofiloff, Paulo (ed.) et al., Proceedings of GRACO2005. Papers from the 2nd Brazilian symposium on graphs, algorithms, and combinatorics, Angra dos Reis, Brazil, April 27–29, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 19, 273-279 (2005).
MSC:  05C85 05C38 68W40
PDFBibTeX XMLCite

Improved exact exponential algorithms for vertex bipartization and other problems. (English) Zbl 1171.68646

Coppo, Mario (ed.) et al., Theoretical computer science. 9th Italian conference, ICTCS 2005, Siena, Italy, October 12–14, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29106-7/pbk). Lecture Notes in Computer Science 3701, 375-389 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Improved parameterized algorithms for feedback set problems in weighted tournaments. (English) Zbl 1104.68547

Downey, Rod (ed.) et al., Parametrized and exact computation. First international workshop, IWPEC 2004, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23071-8/pbk). Lecture Notes in Computer Science 3162, 260-270 (2004).
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity of directed feedback set problems in tournaments. (English) Zbl 1278.68110

Dehne, Frank (ed.) et al., Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 – August 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40545-3/pbk). Lect. Notes Comput. Sci. 2748, 484-492 (2003).
MSC:  68Q25 05C20 68R10
PDFBibTeX XMLCite
Full Text: DOI

Tight bounds for finding degrees from the adjacency matrix. (English) Zbl 1495.68161

Baeza-Yates, Ricardo (ed.) et al., LATIN ’95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3–7, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 911, 49-59 (1995).
PDFBibTeX XMLCite
Full Text: DOI

Path balance heuristic for self-adjusting binary search trees. (English) Zbl 1354.68235

Thiagarajan, P.S. (ed.), Foundations of software technology and theoretical computer science. 15th conference, Bangalore, India, December 18–20, 1995. Proceedings. Berlin: Springer-Verlag (ISBN 3-540-60692-0). Lect. Notes Comput. Sci. 1026, 338-348 (1995).
MSC:  68T20 68P05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

The complexity of finding certain trees in tournaments. (English) Zbl 1504.68153

Dehne, Frank (ed.) et al., Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 709, 142-150 (1993).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

Software