×

Found 6,059 Documents (Results 1–100)

Counters in Kappa: semantics, simulation, and static analysis. (English) Zbl 07770426

Caires, Luís (ed.), Programming languages and systems. 28th European symposium on programming, ESOP 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11423, 176-204 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Rigidity in protein graphs. Paper from the 32rd Brazilian mathematics colloquium – 32°Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, July 28 – August 2, 2019. (Rigidez em grafos de proteínas.) (Portuguese) Zbl 1518.92001

Publicações Matemáticas do IMPA. Rio de Janeiro: Instituto Nacional de Matemática Pura e Aplicada (ISBN 978-85-244-0482-5). ix, 63 p., open access (2019).
PDFBibTeX XMLCite
Full Text: Link

Eigenvalues of regular Kähler graphs having commutative adjacency operators. (English) Zbl 1522.05273

Adachi, Toshiaki (ed.) et al., Recent topics in differential geometry and its related fields. Proceedings of the 6th international colloquium on differential geometry and its related fields, Veliko Tarnovo, Bulgaria, September 4–8, 2018. Singapore: World Scientific. 83-106 (2019).
MSC:  05C50 05C35 15A18
PDFBibTeX XMLCite
Full Text: DOI

Combinatorial and analytical problems for fractals and their graph approximations. (English) Zbl 1515.28002

Uppsala Dissertations in Mathematics 112. Uppsala: Uppsala Univ., Department of Mathematics (Diss.) (ISBN 978-91-506-2739-8). 37 p., open access (2019).
MSC:  28-02 28A80 05Cxx
PDFBibTeX XMLCite
Full Text: Link

Vertex stabilizers of graphs with primitive automorphism groups and a strong version of the Sims conjecture. (English) Zbl 1514.20012

Campbell, C. M. (ed.) et al., Groups St Andrews 2017 in Birmingham. Selected papers of the conference, Birmingham, UK, August 5–13, 2017. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 455, 419-426 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Beating treewidth for average-case subgraph isomorphism. (English) Zbl 1515.68255

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 24, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Subexponential-time algorithms for finding large induced sparse subgraphs. (English) Zbl 1515.68252

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 23, 11 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Improved analysis of highest-degree branching for feedback vertex set. (English) Zbl 1515.68245

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 22, 11 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization. (English) Zbl 1516.68063

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 19, 15 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

C-planarity testing of embedded clustered graphs with bounded dual carving-width. (English) Zbl 1515.68236

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 9, 17 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Faster subgraph counting in sparse graphs. (English) Zbl 1515.68229

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 6, 15 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Metric dimension parameterized by treewidth. (English) Zbl 1515.68227

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 5, 15 p. (2019).
MSC:  68R10 05C12 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Phase transitions of best-of-two and best-of-three on stochastic block models. (English) Zbl 1515.68077

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 32, 17 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Small cuts and connectivity certificates: a fault tolerant approach. (English) Zbl 1515.68080

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 30, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of symmetry breaking in massive graphs. (English) Zbl 1515.68248

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 26, 18 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond. (English) Zbl 1515.68372

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 18, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sublinear-time distributed algorithms for detecting small cliques and even cycles. (English) Zbl 1515.68364

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 15, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Distributed algorithms for low stretch spanning trees. (English) Zbl 1515.68356

Suomela, Jukka (ed.), 33rd international symposium on distributed computing, DISC 2019, Budapest, Hungary, October 14–18, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 146, Article 4, 14 p. (2019).
MSC:  68W15 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI

Testing odd direct sums using high dimensional expanders. (English) Zbl 1522.68741

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 50, 20 p. (2019).
MSC:  68W20 05C48 05E45
PDFBibTeX XMLCite
Full Text: DOI

Deterministic approximation of random walks in small space. (English) Zbl 1528.68314

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 42, 22 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

On a connectivity threshold for colorings of random graphs and hypergraphs. (English) Zbl 1512.05355

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 36, 10 p. (2019).
MSC:  05C80 05C15 05C65
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