×

Found 1,023 Documents (Results 1–100)

\(k\)-way hypergraph partitioning via \(n\)-level recursive bisection. (English) Zbl 1430.68239

Goodrich, Michael (ed.) et al., Proceedings of the 18th workshop on algorithm engineering and experiments, ALENEX ’16, Arlington, VA, USA, January 10, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 53-67 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Experimental evaluation of distributed node coloring algorithms for wireless networks. (English) Zbl 1430.68201

Goodrich, Michael (ed.) et al., Proceedings of the 18th workshop on algorithm engineering and experiments, ALENEX ’16, Arlington, VA, USA, January 10, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 30-38 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subgraphs in non-uniform random hypergraphs. (English) Zbl 1398.05180

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, 140-151 (2016).
MSC:  05C80 05C65
PDFBibTeX XMLCite
Full Text: DOI

Formal model-based constraint solving and document generation. (English) Zbl 1396.68117

Ribeiro, Leila (ed.) et al., Formal methods: foundations and applications. 19th Brazilian symposium, SBMF 2016, Natal, Brazil, November 23–25, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-49814-0/pbk; 978-3-319-49815-7/ebook). Lecture Notes in Computer Science 10090, 3-20 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Polynomial lower bound for distributed graph coloring in a weak LOCAL model. (English) Zbl 1393.68184

Gavoille, Cyril (ed.) et al., Distributed computing. 30th international symposium, DISC 2016, Paris, France, September 27–29, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-53425-0/pbk; 978-3-662-53426-7/ebook). Lecture Notes in Computer Science 9888, 99-113 (2016).
MSC:  68W15 05C15 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithmic and enumerative aspects of the Moser-Tardos distribution. (English) Zbl 1410.05221

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2004-2023 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Finding perfect matchings in bipartite hypergraphs. (English) Zbl 1410.05152

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1814-1823 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Obstructions for three-coloring graphs with one forbidden induced subgraph. (English) Zbl 1410.05063

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1774-1783 (2016).
MSC:  05C15 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

An algorithmic hypergraph regularity lemma. (English) Zbl 1410.05154

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1765-1773 (2016).
MSC:  05C65 05C35 05C85
PDFBibTeX XMLCite
Full Text: DOI

The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs. (English) Zbl 1409.68139

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 458-468 (2016).
PDFBibTeX XMLCite
Full Text: DOI

A distributed asynchronous solver for Nash equilibria in hypergraphical games. (English) Zbl 1396.91046

Kaminka, Gal A. (ed.) et al., ECAI 2016. 22nd European conference on artificial intelligence, The Hague, Netherlands, August 29 – September 2, 2016. Proceedings. Including proceedings of the accompanied conference on prestigious applications of intelligent systems (PAIS 2016). In 2 volumes. Amsterdam: IOS Press (ISBN 978-1-61499-671-2/pbk; 978-1-61499-672-9/ebook). Frontiers in Artificial Intelligence and Applications 285, 1291-1299 (2016).
MSC:  91A43 05C65 91-04
PDFBibTeX XMLCite
Full Text: DOI

Tree-structured graphs. (English) Zbl 1388.05034

Thulasiraman, Krishnaiyan (ed.) et al., Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press (ISBN 978-1-58488-595-5/hbk; 978-1-4200-1107-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 751-827 (2016).
MSC:  05C05 05C65
PDFBibTeX XMLCite

Graph colorings. (English) Zbl 1396.05036

Thulasiraman, Krishnaiyan (ed.) et al., Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press (ISBN 978-1-58488-595-5/hbk; 978-1-4200-1107-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 449-472 (2016).
MSC:  05C15
PDFBibTeX XMLCite

Rewriting modulo symmetric monoidal structure. (English) Zbl 1395.68162

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). 710-719 (2016).
MSC:  68Q42 05C65 18D10
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Parameterized algorithms for list \(K\)-cycle. (English) Zbl 1393.68080

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

\(O(f)\) bi-approximation for capacitated covering with hard capacities. (English) Zbl 1398.05165

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 40, 12 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On \((1,\varepsilon)\)-restricted max-min fair allocation problem. (English) Zbl 1390.68340

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

Sampling in Potts model on sparse random graphs. (English) Zbl 1398.05091

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 19th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2016, and the 20th international workshop on randomization and computation, RANDOM 2016, Paris, France, September 7–9, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-018-7). LIPIcs – Leibniz International Proceedings in Informatics 60, Article 47, 22 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Counting hypergraph matchings up to uniqueness threshold. (English) Zbl 1398.05113

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 19th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2016, and the 20th international workshop on randomization and computation, RANDOM 2016, Paris, France, September 7–9, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-018-7). LIPIcs – Leibniz International Proceedings in Informatics 60, Article 46, 29 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The densest \(k\)-subhypergraph problem. (English) Zbl 1396.68079

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 19th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2016, and the 20th international workshop on randomization and computation, RANDOM 2016, Paris, France, September 7–9, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-018-7). LIPIcs – Leibniz International Proceedings in Informatics 60, Article 6, 19 p. (2016).
MSC:  68R10 05C65 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

The generalised colouring numbers on classes of bounded expansion. (English) Zbl 1398.05089

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 85, 13 p. (2016).
MSC:  05C15 05C75
PDFBibTeX XMLCite
Full Text: DOI arXiv

The ground-set-cost budgeted maximum coverage problem. (English) Zbl 1398.91302

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 50, 13 p. (2016).
MSC:  91B26 68W25 05C15
PDFBibTeX XMLCite
Full Text: DOI

On synchronizing colorings and the eigenvectors of digraphs. (English) Zbl 1398.05092

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 48, 14 p. (2016).
MSC:  05C20 05C15 05C50
PDFBibTeX XMLCite
Full Text: DOI

Using contracted solution graphs for solving reconfiguration problems. (English) Zbl 1398.90188

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 20, 15 p. (2016).
MSC:  90C35 05C15
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the fine-grained complexity of rainbow coloring. (English) Zbl 1397.68102

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 58, 16 p. (2016).
MSC:  68Q25 05C15 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hitting set for hypergraphs of low VC-dimension. (English) Zbl 1397.68092

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 23, 18 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Weak \(\frac 1r\)-nets for moving points. (English) Zbl 1388.05132

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 59, 13 p. (2016).
MSC:  05C65
PDFBibTeX XMLCite
Full Text: DOI

Coloring points with respect to squares. (English) Zbl 1387.05076

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 5, 16 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

FPTAS for hardcore and Ising models on hypergraphs. (English) Zbl 1388.68309

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

Faster exact and parameterized algorithm for feedback vertex set in tournaments. (English) Zbl 1388.68324

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

Quantum query complexity of subgraph isomorphism and homomorphism. (English) Zbl 1388.68071

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

The complexity of the Hamilton cycle problem in hypergraphs of high minimum codegree. (English) Zbl 1388.68114

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

A complexity trichotomy for approximately counting list \(H\)-colourings. (English) Zbl 1388.68113

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 46, 13 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximation via correlation decay when strong spatial mixing fails. (English) Zbl 1388.68300

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 45, 13 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Graph motif problems parameterized by dual. (English) Zbl 1382.68106

Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 7, 12 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Colouring diamond-free graphs. (English) Zbl 1378.68070

Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 16, 14 p. (2016).
MSC:  68Q25 05C15 05C75
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

all top 3

Software