Published in: LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
Philippe Balbiani, Han Gao, Çiğdem Gencer, and Nicola Olivetti. A Natural Intuitionistic Modal Logic: Axiomatization and Bi-Nested Calculus. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 13:1-13:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{balbiani_et_al:LIPIcs.CSL.2024.13, author = {Balbiani, Philippe and Gao, Han and Gencer, \c{C}i\u{g}dem and Olivetti, Nicola}, title = {{A Natural Intuitionistic Modal Logic: Axiomatization and Bi-Nested Calculus}}, booktitle = {32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)}, pages = {13:1--13:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-310-2}, ISSN = {1868-8969}, year = {2024}, volume = {288}, editor = {Murano, Aniello and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.13}, URN = {urn:nbn:de:0030-drops-196565}, doi = {10.4230/LIPIcs.CSL.2024.13}, annote = {Keywords: Intuitionistic Modal Logic, Axiomatization, Completeness, Sequent Calculus} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, and Carsten Thomassen. On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{christiansen_et_al:LIPIcs.MFCS.2022.34, author = {Christiansen, Aleksander B. G. and Holm, Jacob and Rotenberg, Eva and Thomassen, Carsten}, title = {{On Dynamic \alpha + 1 Arboricity Decomposition and Out-Orientation}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.34}, URN = {urn:nbn:de:0030-drops-168320}, doi = {10.4230/LIPIcs.MFCS.2022.34}, annote = {Keywords: Dynamic graphs, bounded arboricity, data structures} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Cristian Riveros and Jorge Salas. A Family of Centrality Measures for Graph Data Based on Subgraphs. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{riveros_et_al:LIPIcs.ICDT.2020.23, author = {Riveros, Cristian and Salas, Jorge}, title = {{A Family of Centrality Measures for Graph Data Based on Subgraphs}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.23}, URN = {urn:nbn:de:0030-drops-119474}, doi = {10.4230/LIPIcs.ICDT.2020.23}, annote = {Keywords: Graph data, graph centrality, centrality measures} }
Published in: LIPIcs, Volume 29, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)
Adrian Bock, Yuri Faenza, Carsten Moldenhauer, and Andres Jacinto Ruiz-Vargas. Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 187-198, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{bock_et_al:LIPIcs.FSTTCS.2014.187, author = {Bock, Adrian and Faenza, Yuri and Moldenhauer, Carsten and Ruiz-Vargas, Andres Jacinto}, title = {{Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number}}, booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)}, pages = {187--198}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-77-4}, ISSN = {1868-8969}, year = {2014}, volume = {29}, editor = {Raman, Venkatesh and Suresh, S. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.187}, URN = {urn:nbn:de:0030-drops-48422}, doi = {10.4230/LIPIcs.FSTTCS.2014.187}, annote = {Keywords: stable set problem, independent set problem, approximation algorithms, odd cycle packing number, maximum subdeterminants} }
Published in: Dagstuhl Reports, Volume 2, Issue 9 (2013)
Carsten Görg, Lawrence Hunter, Jessie Kennedy, Sean O'Donoghue, and Jarke J. Van Wijk. Biological Data Visualization (Dagstuhl Seminar 12372). In Dagstuhl Reports, Volume 2, Issue 9, pp. 131-164, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{gorg_et_al:DagRep.2.9.131, author = {G\"{o}rg, Carsten and Hunter, Lawrence and Kennedy, Jessie and O'Donoghue, Sean and Van Wijk, Jarke J.}, title = {{Biological Data Visualization (Dagstuhl Seminar 12372)}}, pages = {131--164}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {2}, number = {9}, editor = {G\"{o}rg, Carsten and Hunter, Lawrence and Kennedy, Jessie and O'Donoghue, Sean and Van Wijk, Jarke J.}, 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.131}, URN = {urn:nbn:de:0030-drops-39731}, doi = {10.4230/DagRep.2.9.131}, annote = {Keywords: Information visualization, data visualization, biology, bioinformatics, user interfaces, visual analytics} }
Published in: Dagstuhl Seminar Proceedings, Volume 8091, Logic and Probability for Scene Interpretation (2008)
Carsten Elfers, Otthein Herzog, Andrea Miene, and Thomas Wagner. Qualitative Abstraction and Inherent Uncertainty in Scene Recognition. In Logic and Probability for Scene Interpretation. Dagstuhl Seminar Proceedings, Volume 8091, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{elfers_et_al:DagSemProc.08091.11, author = {Elfers, Carsten and Herzog, Otthein and Miene, Andrea and Wagner, Thomas}, title = {{Qualitative Abstraction and Inherent Uncertainty in Scene Recognition}}, booktitle = {Logic and Probability for Scene Interpretation}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8091}, editor = {Anthony G. Cohn and David C. Hogg and Ralf M\"{o}ller and Bernd Neumann}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08091.11}, URN = {urn:nbn:de:0030-drops-16141}, doi = {10.4230/DagSemProc.08091.11}, annote = {Keywords: Scene interpretation, intentional agents, uncertainty, qualitative abstraction, coherence-based perception, abduction, RHMM} }
Published in: Dagstuhl Seminar Proceedings, Volume 7441, Algorithmic-Logical Theory of Infinite Structures (2008)
Stefan Göller, Markus Lohrey, and Carsten Lutz. PDL with Intersection and Converse is 2EXP-complete. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{goller_et_al:DagSemProc.07441.5, author = {G\"{o}ller, Stefan and Lohrey, Markus and Lutz, Carsten}, title = {{PDL with Intersection and Converse is 2EXP-complete}}, booktitle = {Algorithmic-Logical Theory of Infinite Structures}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {7441}, editor = {Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07441.5}, URN = {urn:nbn:de:0030-drops-14093}, doi = {10.4230/DagSemProc.07441.5}, annote = {Keywords: Satisfiability, Propositional Dynamic Logic, Computational Complexity} }
Feedback for Dagstuhl Publishing