Published in: LIPIcs, Volume 242, 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)
Marília D. V. Braga, Leonie R. Brockmann, Katharina Klerx, and Jens Stoye. A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance. In 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 242, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{braga_et_al:LIPIcs.WABI.2022.13, author = {Braga, Mar{\'\i}lia D. V. and Brockmann, Leonie R. and Klerx, Katharina and Stoye, Jens}, title = {{A Linear Time Algorithm for an Extended Version of the Breakpoint Double Distance}}, booktitle = {22nd International Workshop on Algorithms in Bioinformatics (WABI 2022)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-243-3}, ISSN = {1868-8969}, year = {2022}, volume = {242}, editor = {Boucher, Christina and Rahmann, Sven}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2022.13}, URN = {urn:nbn:de:0030-drops-170472}, doi = {10.4230/LIPIcs.WABI.2022.13}, annote = {Keywords: Comparative genomics, genome rearrangement, breakpoint distance, double-cut-and-join (DCJ) distance, double distance} }
Published in: LIPIcs, Volume 172, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020)
Diego P. Rubert, Fábio V. Martinez, and Marília D. V. Braga. Natural Family-Free Genomic Distance. In 20th International Workshop on Algorithms in Bioinformatics (WABI 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 172, pp. 3:1-3:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{rubert_et_al:LIPIcs.WABI.2020.3, author = {Rubert, Diego P. and Martinez, F\'{a}bio V. and Braga, Mar{\'\i}lia D. V.}, title = {{Natural Family-Free Genomic Distance}}, booktitle = {20th International Workshop on Algorithms in Bioinformatics (WABI 2020)}, pages = {3:1--3:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-161-0}, ISSN = {1868-8969}, year = {2020}, volume = {172}, editor = {Kingsford, Carl and Pisanti, Nadia}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2020.3}, URN = {urn:nbn:de:0030-drops-127926}, doi = {10.4230/LIPIcs.WABI.2020.3}, annote = {Keywords: Comparative genomics, Genome rearrangement, DCJ-indel distance} }
Published in: LIPIcs, Volume 148, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro, Fábio Protti, and Uéverton S. Souza. Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. In 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 148, pp. 2:1-2:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bessy_et_al:LIPIcs.IPEC.2019.2, author = {Bessy, St\'{e}phane and Bougeret, Marin and Carneiro, Alan D. A. and Protti, F\'{a}bio and Souza, U\'{e}verton S.}, title = {{Width Parameterizations for Knot-Free Vertex Deletion on Digraphs}}, booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)}, pages = {2:1--2:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-129-0}, ISSN = {1868-8969}, year = {2019}, volume = {148}, editor = {Jansen, Bart M. P. and Telle, Jan Arne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2019.2}, URN = {urn:nbn:de:0030-drops-114631}, doi = {10.4230/LIPIcs.IPEC.2019.2}, annote = {Keywords: Knot, deadlock, width measure, FPT, W\lbrack1\rbrack-hard, directed feedback vertex set} }
Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, and Andreas Tönnis. SUPERSET: A (Super)Natural Variant of the Card Game SET. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{botler_et_al:LIPIcs.FUN.2018.12, author = {Botler, F\'{a}bio and Cristi, Andr\'{e}s and Hoeksma, Ruben and Schewior, Kevin and T\"{o}nnis, Andreas}, title = {{SUPERSET: A (Super)Natural Variant of the Card Game SET}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.12}, URN = {urn:nbn:de:0030-drops-88035}, doi = {10.4230/LIPIcs.FUN.2018.12}, annote = {Keywords: SET, SUPERSET, card game, cap set, affine geometry, computational complexity} }
Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Bart Jacobs and Fabio Zanasi. A Formal Semantics of Influence in Bayesian Reasoning. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jacobs_et_al:LIPIcs.MFCS.2017.21, author = {Jacobs, Bart and Zanasi, Fabio}, title = {{A Formal Semantics of Influence in Bayesian Reasoning}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.21}, URN = {urn:nbn:de:0030-drops-80896}, doi = {10.4230/LIPIcs.MFCS.2017.21}, annote = {Keywords: probability distribution, Bayesian network, influence} }
Published in: Dagstuhl Manifestos, Volume 3, Issue 1 (2013)
Anthony D. Joseph, Pavel Laskov, Fabio Roli, J. Doug Tygar, and Blaine Nelson. Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371). In Dagstuhl Manifestos, Volume 3, Issue 1, pp. 1-30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{joseph_et_al:DagMan.3.1.1, author = {Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine}, title = {{Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371)}}, pages = {1--30}, journal = {Dagstuhl Manifestos}, ISSN = {2193-2433}, year = {2013}, volume = {3}, number = {1}, editor = {Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagMan.3.1.1}, URN = {urn:nbn:de:0030-drops-43569}, doi = {10.4230/DagMan.3.1.1}, annote = {Keywords: Adversarial Learning, Computer Security, Robust Statistical Learning, Online Learning with Experts, Game Theory, Learning Theory} }
Published in: Dagstuhl Reports, Volume 2, Issue 9 (2013)
Anthony D. Joseph, Pavel Laskov, Fabio Roli, J. Doug Tygar, and Blaine Nelson. Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371). In Dagstuhl Reports, Volume 2, Issue 9, pp. 109-130, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{joseph_et_al:DagRep.2.9.109, author = {Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine}, title = {{Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371)}}, pages = {109--130}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {2}, number = {9}, editor = {Joseph, Anthony D. and Laskov, Pavel and Roli, Fabio and Tygar, J. Doug and Nelson, Blaine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.9.109}, URN = {urn:nbn:de:0030-drops-37908}, doi = {10.4230/DagRep.2.9.109}, annote = {Keywords: Adversarial Learning, Computer Security, Robust Statistical Learning, Online Learning with Experts, Game Theory, Learning Theory} }
Feedback for Dagstuhl Publishing