Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Jared Espenant, J. Mark Keil, and Debajyoti Mondal. Finding a Maximum Clique in a Disk Graph. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 30:1-30:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{espenant_et_al:LIPIcs.SoCG.2023.30, author = {Espenant, Jared and Keil, J. Mark and Mondal, Debajyoti}, title = {{Finding a Maximum Clique in a Disk Graph}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.30}, URN = {urn:nbn:de:0030-drops-178803}, doi = {10.4230/LIPIcs.SoCG.2023.30}, annote = {Keywords: Maximum clique, Disk graph, Time complexity, APX-hardness} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Prosenjit Bose, Saeed Mehrabi, and Debajyoti Mondal. Parameterized Complexity of Two-Interval Pattern Problem. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 16:1-16:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bose_et_al:LIPIcs.SWAT.2020.16, author = {Bose, Prosenjit and Mehrabi, Saeed and Mondal, Debajyoti}, title = {{Parameterized Complexity of Two-Interval Pattern Problem}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {16:1--16:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.16}, URN = {urn:nbn:de:0030-drops-122630}, doi = {10.4230/LIPIcs.SWAT.2020.16}, annote = {Keywords: Interval graphs, Two-interval pattern problem, Comparability, Multicoloured clique problem, Parameterized complexity, W\lbrack1\rbrack-hardness} }
Published in: LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, and Debajyoti Mondal. Boundary Labeling for Rectangular Diagrams. In 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 101, pp. 12:1-12:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{bose_et_al:LIPIcs.SWAT.2018.12, author = {Bose, Prosenjit and Carmi, Paz and Keil, J. Mark and Mehrabi, Saeed and Mondal, Debajyoti}, title = {{Boundary Labeling for Rectangular Diagrams}}, booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-068-2}, ISSN = {1868-8969}, year = {2018}, volume = {101}, editor = {Eppstein, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.12}, URN = {urn:nbn:de:0030-drops-88386}, doi = {10.4230/LIPIcs.SWAT.2018.12}, annote = {Keywords: Boundary labeling, Dynamic programming, Outerstring graphs} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Stephane Durocher and Debajyoti Mondal. Relating Graph Thickness to Planar Layers and Bend Complexity. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 10:1-10:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{durocher_et_al:LIPIcs.ICALP.2016.10, author = {Durocher, Stephane and Mondal, Debajyoti}, title = {{Relating Graph Thickness to Planar Layers and Bend Complexity}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.10}, URN = {urn:nbn:de:0030-drops-62767}, doi = {10.4230/LIPIcs.ICALP.2016.10}, annote = {Keywords: Graph Drawing, Thickness, Geometric Thickness, Layers; Bends} }
Feedback for Dagstuhl Publishing