Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Ferdinando Cicalese, Clément Dallard, and Martin Milanič. On Constrained Intersection Representations of Graphs and Digraphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 38:1-38:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cicalese_et_al:LIPIcs.ISAAC.2022.38, author = {Cicalese, Ferdinando and Dallard, Cl\'{e}ment and Milani\v{c}, Martin}, title = {{On Constrained Intersection Representations of Graphs and Digraphs}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {38:1--38:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.38}, URN = {urn:nbn:de:0030-drops-173239}, doi = {10.4230/LIPIcs.ISAAC.2022.38}, annote = {Keywords: Directed intersection representation, intersection number} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
Zsuzsanna Lipták, Simon J. Puglisi, and Massimiliano Rossi. Pattern Discovery in Colored Strings. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{liptak_et_al:LIPIcs.SEA.2020.12, author = {Lipt\'{a}k, Zsuzsanna and Puglisi, Simon J. and Rossi, Massimiliano}, title = {{Pattern Discovery in Colored Strings}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-148-1}, ISSN = {1868-8969}, year = {2020}, volume = {160}, editor = {Faro, Simone and Cantone, Domenico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.12}, URN = {urn:nbn:de:0030-drops-120862}, doi = {10.4230/LIPIcs.SEA.2020.12}, annote = {Keywords: property testing, suffix tree, pattern mining} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Rudolf Ahlswede, Ferdinando Cicalese, and Ugo Vaccaro. 09281 Abstracts Collection – Search Methodologies. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{ahlswede_et_al:DagSemProc.09281.1, author = {Ahlswede, Rudolf and Cicalese, Ferdinando and Vaccaro, Ugo}, title = {{09281 Abstracts Collection – Search Methodologies}}, booktitle = {Search Methodologies}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.1}, URN = {urn:nbn:de:0030-drops-22457}, doi = {10.4230/DagSemProc.09281.1}, annote = {Keywords: Search algorithms, group testing, fault-tolerance, identification, decision tree, multi-access communication} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Ely Porat and Amir Rotschild. Explicit Non-Adaptive Combinatorial Group Testing Schemes. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{porat_et_al:DagSemProc.09281.2, author = {Porat, Ely and Rotschild, Amir}, title = {{Explicit Non-Adaptive Combinatorial Group Testing Schemes}}, booktitle = {Search Methodologies}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.2}, URN = {urn:nbn:de:0030-drops-22414}, doi = {10.4230/DagSemProc.09281.2}, annote = {Keywords: Prime Numbers, Group Testing, Streaming, Pattern Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Charles J. Colbourn and Daniel W. McClary. Locating and Detecting Arrays for Interaction Faults. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{colbourn_et_al:DagSemProc.09281.3, author = {Colbourn, Charles J. and McClary, Daniel W.}, title = {{Locating and Detecting Arrays for Interaction Faults}}, booktitle = {Search Methodologies}, pages = {1--34}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.3}, URN = {urn:nbn:de:0030-drops-22405}, doi = {10.4230/DagSemProc.09281.3}, annote = {Keywords: Covering array, Orthogonal array, Factorial design, Cover-free family, Disjunct matrix, Locating array, Detecting array} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Pawel Gawrychowski and Travis Gagie. Minimax Trees in Linear Time with Applications. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gawrychowski_et_al:DagSemProc.09281.4, author = {Gawrychowski, Pawel and Gagie, Travis}, title = {{Minimax Trees in Linear Time with Applications}}, booktitle = {Search Methodologies}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.4}, URN = {urn:nbn:de:0030-drops-22421}, doi = {10.4230/DagSemProc.09281.4}, annote = {Keywords: Data structures, data compression, prefix-free coding} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Raphael Clifford, Klim Efremo, Ely Porat, and Amir Rotschild. Pattern matching with don't cares and few errors. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{clifford_et_al:DagSemProc.09281.5, author = {Clifford, Raphael and Efremo, Klim and Porat, Ely and Rotschild, Amir}, title = {{Pattern matching with don't cares and few errors}}, booktitle = {Search Methodologies}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.5}, URN = {urn:nbn:de:0030-drops-22442}, doi = {10.4230/DagSemProc.09281.5}, annote = {Keywords: Prime Numbers, Group Testing, Streaming, Pattern Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Gábor Wiener. Rounds in Combinatorial Search. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{wiener:DagSemProc.09281.6, author = {Wiener, G\'{a}bor}, title = {{Rounds in Combinatorial Search}}, booktitle = {Search Methodologies}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.6}, URN = {urn:nbn:de:0030-drops-22399}, doi = {10.4230/DagSemProc.09281.6}, annote = {Keywords: Search, group testing, adaptiveness, hypergraph, trace} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Kingo Kobayashi. Some Aspects of Finite State Channel related to Hidden Markov Process. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{kobayashi:DagSemProc.09281.7, author = {Kobayashi, Kingo}, title = {{Some Aspects of Finite State Channel related to Hidden Markov Process}}, booktitle = {Search Methodologies}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.7}, URN = {urn:nbn:de:0030-drops-22434}, doi = {10.4230/DagSemProc.09281.7}, annote = {Keywords: Finite state channel, Hidden Markov source, Gilbert-Elliot channel, Trapdoor Channel} }
Feedback for Dagstuhl Publishing