×

Found 36 Documents (Results 1–36)

A general algorithmic scheme for modular decompositions of hypergraphs and applications. (English) Zbl 1534.68166

Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11638, 251-264 (2019).
Full Text: DOI

Modular-width: an auxiliary parameter for parameterized parallel complexity. (English) Zbl 1429.68326

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, 139-150 (2017).
MSC:  68W10 68Q27 68R10
Full Text: DOI

Unifying the representation of symmetric crossing families and weakly partitive families. (English) Zbl 1273.05233

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 329-333 (2009).
Full Text: DOI

A representation theorem for union-difference families and application. (Extended abstract). (English) Zbl 1136.68444

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 492-503 (2008).
MSC:  68R05 68R10 05C70
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software