Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Kengo Nakamura, Masaaki Nishino, Norihito Yasuda, and Shin-ichi Minato. CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{nakamura_et_al:LIPIcs.SEA.2023.11, author = {Nakamura, Kengo and Nishino, Masaaki and Yasuda, Norihito and Minato, Shin-ichi}, title = {{CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {11:1--11:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.11}, URN = {urn:nbn:de:0030-drops-183613}, doi = {10.4230/LIPIcs.SEA.2023.11}, annote = {Keywords: Subgraph counting, Connectivity, Zero-suppressed Binary Decision Diagram} }
Published in: LIPIcs, Volume 226, 11th International Conference on Fun with Algorithms (FUN 2022)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, and Ryo Yoshinaka. Sorting Balls and Water: Equivalence and Computational Complexity. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 16:1-16:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ito_et_al:LIPIcs.FUN.2022.16, author = {Ito, Takehiro and Kawahara, Jun and Minato, Shin-ichi and Otachi, Yota and Saitoh, Toshiki and Suzuki, Akira and Uehara, Ryuhei and Uno, Takeaki and Yamanaka, Katsuhisa and Yoshinaka, Ryo}, title = {{Sorting Balls and Water: Equivalence and Computational Complexity}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {16:1--16:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.16}, URN = {urn:nbn:de:0030-drops-159867}, doi = {10.4230/LIPIcs.FUN.2022.16}, annote = {Keywords: Ball sort puzzle, recreational mathematics, sorting pairs in bins, water sort puzzle} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
François Le Gall and Masayuki Miyamoto. Lower Bounds for Induced Cycle Detection in Distributed Computing. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 58:1-58:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{legall_et_al:LIPIcs.ISAAC.2021.58, author = {Le Gall, Fran\c{c}ois and Miyamoto, Masayuki}, title = {{Lower Bounds for Induced Cycle Detection in Distributed Computing}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {58:1--58:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.58}, URN = {urn:nbn:de:0030-drops-154919}, doi = {10.4230/LIPIcs.ISAAC.2021.58}, annote = {Keywords: Distributed computing, Lower bounds, Subgraph detection} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
Yu Nakahata, Masaaki Nishino, Jun Kawahara, and Shin-ichi Minato. Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{nakahata_et_al:LIPIcs.SEA.2020.9, author = {Nakahata, Yu and Nishino, Masaaki and Kawahara, Jun and Minato, Shin-ichi}, title = {{Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {9:1--9: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.9}, URN = {urn:nbn:de:0030-drops-120831}, doi = {10.4230/LIPIcs.SEA.2020.9}, annote = {Keywords: Subgraph, Enumeration, Decision Diagram, Zero-suppressed Sentential Decision Diagram (ZSDD), Top-down construction algorithm} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Bernd Becker, Christoph Meinel, Shin-Ichi Minato, and Fabio Somenzi. Computer Aided Design and Test Decision Diagrams - Concepts and Applications (Dagstuhl Seminar 99041). Dagstuhl Seminar Report 229, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1999)
@TechReport{becker_et_al:DagSemRep.229, author = {Becker, Bernd and Meinel, Christoph and Minato, Shin-Ichi and Somenzi, Fabio}, title = {{Computer Aided Design and Test Decision Diagrams - Concepts and Applications (Dagstuhl Seminar 99041)}}, pages = {1--16}, ISSN = {1619-0203}, year = {1999}, type = {Dagstuhl Seminar Report}, number = {229}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.229}, URN = {urn:nbn:de:0030-drops-151155}, doi = {10.4230/DagSemRep.229}, }
Feedback for Dagstuhl Publishing