×

Found 139 Documents (Results 1–100)

An ETH-tight algorithm for bidirected Steiner connectivity. (English) Zbl 07789730

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 588-604 (2023).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterized approaches to orthogonal compaction. (English) Zbl 07726599

Gąsieniec, Leszek (ed.), SOFSEM 2023: theory and practice of computer science. 48th international conference on current trends in theory and practice of computer science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13878, 111-125 (2023).
MSC:  68R10 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Grid recognition: classical and parameterized computational perspectives. (English) Zbl 07788610

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 37, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

FPT-approximation for FPT problems. (English) Zbl 07788352

Marx, Dániel (ed.), Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 199-218 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Efficient computation of representative weight functions with applications to parameterized counting (extended version). (English) Zbl 07788351

Marx, Dániel (ed.), Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms, SODA 2021, Alexandria, VA, USA, virtual, January 10–13, 2021. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 179-198 (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. (English) Zbl 1482.68023

LIPIcs – Leibniz International Proceedings in Informatics 214. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-216-7). xvii, 35 articles, not consecutively paged, electronic only, open access (2021).
PDFBibTeX XMLCite
Full Text: DOI Link

ETH-tight algorithms for long path and cycle on unit disk graphs. (English) Zbl 07760173

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 44, 18 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

The parameterized complexity of guarding almost convex polygons. (English) Zbl 07760132

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 3, 16 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized study of Steiner tree on unit disk graphs. (English) Zbl 07759281

Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 13, 18 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameter analysis for guarding terrains. (English) Zbl 07759272

Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 4, 18 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Fault tolerant subgraphs with applications in kernelization. (English) Zbl 07650395

Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 47, 22 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterization above a multiplicative guarantee. (English) Zbl 07650387

Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 39, 13 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Efficient graph minors theory and parameterized algorithms for (planar) disjoint paths. (English) Zbl 07604208

Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 112-128 (2020).
MSC:  68-XX
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized analysis of art gallery and terrain guarding. (English) Zbl 07603910

Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 16-29 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Graph Hamiltonicity parameterized by proper interval deletion set. (English) Zbl 07600768

Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 104-115 (2020).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Approximation schemes via width/weight trade-offs on minor-free graphs. (English) Zbl 07304165

Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2299-2318 (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterized complexity and approximability of directed odd cycle transversal. (English) Zbl 07304158

Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2181-2200 (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hitting topological minors is FPT. (English) Zbl 07298330

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 1317-1326 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

An exponential time parameterized algorithm for planar disjoint paths. (English) Zbl 07298329

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 1307-1316 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Packing arc-disjoint cycles in tournaments. (English) Zbl 07561671

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 27, 14 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Decomposition of map graphs with applications. (English) Zbl 07561553

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 60, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Covering vectors by spaces in perturbed graphic matroids and their duals. (English) Zbl 07561552

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 59, 13 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximate counting of \(k\)-paths: deterministic and in polynomial space. (English) Zbl 07561517

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 24, 15 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Connecting the dots (with Minimum Crossings). (English) Zbl 07559207

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 7, 17 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

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

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

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:  68Q27 68R10
PDFBibTeX XMLCite
Full Text: DOI

Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS. (English) Zbl 07152233

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 523-537 (2019).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Balanced stable marriage: how close is close enough? (English) Zbl 1517.68143

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 423-437 (2019).
MSC:  68Q27 91B68
PDFBibTeX XMLCite
Full Text: DOI arXiv

Popular matching in roommates setting is NP-hard. (English) Zbl 1432.68163

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2810-2822 (2019).
MSC:  68Q17 05C70 91B68
PDFBibTeX XMLCite
Full Text: DOI arXiv

On \(r\)-simple \(k\)-path and related problems parameterized by \(k/r\). (English) Zbl 1432.68194

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1750-1769 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Interval vertex deletion admits a polynomial kernel. (English) Zbl 1432.68185

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1711-1730 (2019).
MSC:  68Q27 05C62 05C85
PDFBibTeX XMLCite
Full Text: DOI

Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity. (English) Zbl 1431.68100

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1035-1054 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Parameterized computational geometry via decomposition theorems. (English) Zbl 1434.68615

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 15-27 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Kernelization. Theory of parameterized preprocessing. (English) Zbl 1426.68003

Cambridge: Cambridge University Press (ISBN 978-1-107-05776-0/hbk; 978-1-107-41515-7/ebook). xiv, 515 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number. (English) Zbl 1528.68311

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 35, 19 p. (2018).
MSC:  68R10 05C20 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems. (English) Zbl 1499.68395

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 1, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reducing CMSO model checking to highly connected graphs. (English) Zbl 1499.68203

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 135, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Brief announcement: Treewidth modulator: emergency exit for DFVS. (English) Zbl 1499.68284

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 110, 4 p. (2018).
MSC:  68R10 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Quasipolynomial representation of transversal matroids with applications in parameterized complexity. (English) Zbl 1462.68081

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 32, 13 p. (2018).
MSC:  68Q25 05B35 68Q27
PDFBibTeX XMLCite
Full Text: DOI

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

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:  05C70 05C35 68Q27
PDFBibTeX XMLCite
Full Text: DOI

The parameterized complexity of cycle packing: indifference is not an issue. (English) Zbl 1504.68175

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

Max-Cut Above Spanning Tree is fixed-parameter tractable. (English) Zbl 1434.68747

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

Parameterized algorithms for survivable network design with uniform demands. (English) Zbl 1403.90559

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). 2838-2850 (2018).
MSC:  90C27 68W40 90C35
PDFBibTeX XMLCite
Full Text: Link

Covering small independent sets and separators with applications to parameterized algorithms. (English) Zbl 1403.68337

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). 2785-2800 (2018).
PDFBibTeX XMLCite
Full Text: arXiv Link

Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. (English) Zbl 1403.68167

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). 331-342 (2018).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: Link

Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. (English) Zbl 1403.68164

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). 262-273 (2018).
PDFBibTeX XMLCite
Full Text: Link

Packing cycles faster than Erdős-Pósa. (English) Zbl 1441.05210

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

Finding, hitting and packing cycles in subexponential time on unit disk graphs. (English) Zbl 1441.68179

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

Parameterized algorithms and kernels for rainbow matching. (English) Zbl 1435.68237

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

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field