( en | de | ru )

 

Disambiguation of "Mondal, Debajyoti"

Author of the publication

copydeleteadd this publication to your clipboard
A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps.

, and . VISIGRAPP (3: IVAPP), page 108-119. SciTePress, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Padmabati Mondal

Debajyoti Pati

Pia Mondal

Manas Mondal

Jayanta Mondal

 

Other publications of authors with the same name

A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps., and . CoRR, (2017)(Faster) Multi-Sided Boundary Labelling., , and . CoRR, (2020)On the Biplanar Crossing Number of Kn., , and . CCCG, page 93-100. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Computing Maximum Independent Set on Outerstring Graphs and Their Relatives., , , , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 211-224. Springer, (2019)Construction and Local Routing for Angle-Monotone Graphs., and . WG, volume 11159 of Lecture Notes in Computer Science, page 356-368. Springer, (2018)Orthogonal Layout with Optimal Face Complexity., , and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 121-133. Springer, (2016)Parameterized Complexity of Two-Interval Pattern Problem., , and . SWAT, volume 162 of LIPIcs, page 16:1-16:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Boundary Labeling for Rectangular Diagrams., , , , and . SWAT, volume 101 of LIPIcs, page 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)APX-Hardness and Approximation for the k-Burning Number Problem., , , and . CoRR, (2020)Recognition and drawing of stick graphs., , , , and . Theor. Comput. Sci., (2019)