default search action
Debajyoti Mondal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j44]Sakib Mostafa, Shamse Tasnim Cynthia
, Banani Roy, Debajyoti Mondal
Feature transformation for improved software bug detection and commit classification. J. Syst. Softw. 219: 112205 (2025) - [j43]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Approximation algorithms for minimum ply covering of points with unit squares and unit disks. Theor. Comput. Sci. 1024: 114906 (2025) - 2024
- [j42]Md. Manzurul Hasan
Relating planar graph drawings to planar satisfiability problems. Inf. Process. Lett. 184: 106446 (2024) - [j41]Debajyoti Mondal
On the oriented diameter of planar triangulations. J. Comb. Optim. 47(5): 79 (2024) - [c80]Sara Di Bartolomeo, Fabian Klute, Debajyoti Mondal, Jules Wulms:
Graph Drawing Contest Report (Graph Drawing Contest Report). GD 2024: 41:1-41:13 - [c79]Debajyoti Mondal
On the 3-Tree Core of Plane Graphs. TAMC 2024: 149-160 - [i39]J. Mark Keil, Debajyoti Mondal:
The Maximum Clique Problem in a Disk Graph Made Easy. CoRR abs/2404.03751 (2024) - [i38]J. Mark Keil, Fraser McLeod, Debajyoti Mondal:
Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond. CoRR abs/2404.04535 (2024) - [i37]Therese Biedl, Debajyoti Mondal:
Improved Outerplanarity Bounds for Planar Graphs. CoRR abs/2407.04282 (2024) - 2023
- [j40]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
Drawing Partial 2-Trees with Few Slopes. Algorithmica 85(5): 1156-1175 (2023) - [j39]Sakib Mostafa, Debajyoti Mondal, Karim Panjvani, Leon Kochian, Ian Stavness:
Explainable deep learning in plant phenotyping. Frontiers Artif. Intell. 6 (2023) - [j38]Bardia Hamedmohseni, Zahed Rahmati
Emanation Graph: A Plane Geometric Spanner with Steiner Points. Graphs Comb. 39(2): 38 (2023) - [j37]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. Int. J. Comput. Geom. Appl. 33(1&2): 25-41 (2023) - [c78]Saikat Mondal, Debajyoti Mondal, Chanchal K. Roy:
Investigating Technology Usage Span by Analyzing Users' Q&A Traces in Stack Overflow. APSEC 2023: 589-593 - [c77]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Disks. CCCG 2023: 19-25 - [c76]Jared Espenant, J. Mark Keil, Debajyoti Mondal:
Finding a Maximum Clique in a Disk Graph. SoCG 2023: 30:1-30:17 - [c75]Md Shamimur Rahman
Integrating Visual Aids to Enhance the Code Reviewer Selection Process. ICSME 2023: 293-305 - [c74]Ehsan Moradi, Debajyoti Mondal:
BigGraphVis: Visualizing Communities in Big Graphs Leveraging GPU-Accelerated Streaming Algorithms. VISIGRAPP (3: IVAPP) 2023: 195-202 - [c73]Subroto Nag Pinku, Debajyoti Mondal, Chanchal K. Roy:
Pathways to Leverage Transcompiler based Data Augmentation for Cross-Language Clone Detection. ICPC 2023: 169-180 - [c72]Subroto Nag Pinku, Debajyoti Mondal, Chanchal K. Roy:
TransClone: A Language Agnostic Code Clone Detector. IWSC 2023: 29-32 - [c71]Stephane Durocher, J. Mark Keil, Debajyoti Mondal
Minimum Ply Covering of Points with Unit Squares. WALCOM 2023: 23-35 - [c70]Prashant Gokhale, J. Mark Keil, Debajyoti Mondal
Improved and Generalized Algorithms for Burning a Planar Point Set. WALCOM 2023: 90-101 - [i36]Subroto Nag Pinku, Debajyoti Mondal, Chanchal K. Roy:
Pathways to Leverage Transcompiler based Data Augmentation for Cross-Language Clone Detection. CoRR abs/2303.01435 (2023) - [i35]Jared Espenant, J. Mark Keil, Debajyoti Mondal:
Finding a Maximum Clique in a Disk Graph. CoRR abs/2303.07645 (2023) - [i34]Saikat Mondal, Debajyoti Mondal, Chanchal K. Roy:
Investigating Technology Usage Span by Analyzing Users' Q&A Traces in Stack Overflow. CoRR abs/2312.03182 (2023) - 2022
- [j36]Md. Nadim
Leveraging structural properties of source code graphs for just-in-time bug prediction. Autom. Softw. Eng. 29(1): 27 (2022) - [j35]Prosenjit Bose, Paz Carmi
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103: 101852 (2022) - [j34]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j33]Sakib Mostafa, Debajyoti Mondal, Michael A. Beck, Christopher P. Bidinosti, Christopher J. Henry, Ian Stavness:
Leveraging Guided Backpropagation to Select Convolutional Neural Networks for Plant Classification. Frontiers Artif. Intell. 5: 871162 (2022) - [j32]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. J. Graph Algorithms Appl. 26(1): 553-575 (2022) - [j31]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. J. Graph Algorithms Appl. 26(4): 421-446 (2022) - [j30]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized complexity of two-interval pattern problem. Theor. Comput. Sci. 902: 21-28 (2022) - [j29]Md. Manzurul Hasan
Positive planar satisfiability problems under 3-connectivity constraints. Theor. Comput. Sci. 917: 81-93 (2022) - [j28]Debajyoti Mondal, Angelin Jemima Rajasingh, N. Parthiban
APX-hardness and approximation for the k-burning number problem. Theor. Comput. Sci. 932: 21-30 (2022) - [c69]Shisong Wang, Debajyoti Mondal, Sara Sadri, Chanchal K. Roy, James S. Famiglietti
SET-STAT-MAP: Extending Parallel Sets for Visualizing Mixed Data. PacificVis 2022: 151-160 - [c68]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Burning Number for the Points in the Plane. CCCG 2022: 205-211 - [c67]Debajyoti Mondal
Bounds for the Oriented Diameter of Planar Triangulations. FAW 2022: 192-205 - [c66]Shamse Tasnim Cynthia
Feature Transformation for Improved Software Bug Detection Models. ISEC 2022: 16:1-16:10 - [c65]Jared Espenant, Debajyoti Mondal:
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams. WALCOM 2022: 97-108 - [i33]Md. Nadim, Debajyoti Mondal, Chanchal K. Roy:
Leveraging Structural Properties of Source Code Graphs for Just-In-Time Bug Prediction. CoRR abs/2201.10137 (2022) - [i32]Debajyoti Mondal, N. Parthiban, Indra Rajasingh:
Oriented Diameter of Planar Triangulations. CoRR abs/2203.04253 (2022) - [i31]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Burning Number for the Points in the Plane. CoRR abs/2205.04643 (2022) - [i30]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Squares. CoRR abs/2208.06122 (2022) - [i29]Prashant Gokhale, J. Mark Keil, Debajyoti Mondal:
Improved and Generalized Algorithms for Burning a Planar Point Set. CoRR abs/2209.13024 (2022) - 2021
- [j27]Debajyoti Mondal
Simultaneous Embedding of Colored Graphs. Graphs Comb. 37(3): 747-760 (2021) - [c64]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. COCOON 2021: 203-214 - [c63]Khalad Hasan, Debajyoti Mondal, Karanmeet Khatra, David Ahlström, Carman Neustaedter:
CoAware: Designing Solutions for Being Aware of a Co-Located Partner's Smartphone Usage Activities. Graphics Interface 2021: 46-55 - [c62]Gazi Md. Hasnat Zahan, Debajyoti Mondal, Carl Gutwin:
Contour Line Stylization to Visualize Multivariate Information. Graphics Interface 2021: 198-201 - [c61]Sakib Mostafa, Debajyoti Mondal, Michael A. Beck, Christopher P. Bidinosti, Christopher J. Henry, Ian Stavness:
Visualizing Feature Maps for Model Selection in Convolutional Neural Networks. ICCVW 2021: 1362-1371 - [c60]Mohammad Rakib Hasan, Debajyoti Mondal, Jarin Tasnim, Kevin A. Schneider:
Putting Table Cartograms into Practice. ISVC (1) 2021: 91-102 - [c59]Zonayed Ahmed, Michael Beyene, Debajyoti Mondal, Chanchal K. Roy, Christopher Dutchyn, Kevin A. Schneider:
ContourDiff: Revealing Differential Trends in Spatiotemporal Data. IV 2021: 35-41 - [c58]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Faster Multi-sided One-Bend Boundary Labelling. WALCOM 2021: 116-128 - [c57]Debajyoti Mondal
APX-Hardness and Approximation for the k-Burning Number Problem. WALCOM 2021: 272-283 - [i28]Debajyoti Mondal:
Simultaneous Embedding of Colored Graphs. CoRR abs/2101.06596 (2021) - [i27]Jared Espenant, Debajyoti Mondal:
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams. CoRR abs/2103.15037 (2021) - [i26]Sakib Mostafa, Debajyoti Mondal:
On the Evolution of Neuron Communities in a Deep Learning Architecture. CoRR abs/2106.04693 (2021) - [i25]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CoRR abs/2107.05198 (2021) - [i24]Ehsan Moradi, Debajyoti Mondal:
BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs. CoRR abs/2108.00529 (2021) - [i23]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. CoRR abs/2108.12464 (2021) - [i22]Md. Manzurul Hasan, Debajyoti Mondal, Md. Saidur Rahman:
Positive Planar Satisfiability Problems under 3-Connectivity Constraints. CoRR abs/2108.12500 (2021) - 2020
- [j26]Prosenjit Bose, Stephane Durocher
Local Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 30(1): 1-17 (2020) - [j25]Sergio Cabello
Minimum shared-power edge cut. Networks 75(3): 321-333 (2020) - [j24]Anna Lubiw, Debajyoti Mondal:
On compatible triangulations with a minimum number of Steiner points. Theor. Comput. Sci. 835: 97-107 (2020) - [c56]Khalad Hasan, Debajyoti Mondal, David Ahlström, Carman Neustaedter:
An exploration of rules and tools for family members to limit co-located smartphone usage. AH 2020: 7:1-7:8 - [c55]Mohammad Rakib Hasan, Debajyoti Mondal, Carl Gutwin:
Tracing shapes with eyes: design and evaluation of an eye tracking based approach. AH 2020: 19:1-19:4 - [c54]Jarin Tasnim, Debajyoti Mondal:
Data Reduction and Deep-Learning Based Recovery for Geospatial Visualization and Satellite Imagery. IEEE BigData 2020: 5276-5285 - [c53]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CCCG 2020: 160-166 - [c52]Venkat Bandi, Debajyoti Mondal, Brent Thoma:
Scope and Impact of Visualization in Training Professionals in Academic Medicine. Graphics Interface 2020: 84-94 - [c51]Bardia Hamedmohseni, Zahed Rahmati
Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points. SOFSEM 2020: 607-616 - [c50]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. SWAT 2020: 16:1-16:10 - [e1]J. Mark Keil, Debajyoti Mondal:
Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon, Saskatchewan, Canada. 2020 [contents] - [i21]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. CoRR abs/2002.05099 (2020) - [i20]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
(Faster) Multi-Sided Boundary Labelling. CoRR abs/2002.09740 (2020) - [i19]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CoRR abs/2004.07996 (2020) - [i18]Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh:
APX-Hardness and Approximation for the k-Burning Number Problem. CoRR abs/2006.14733 (2020)
2010 – 2019
- 2019
- [j23]Stephane Durocher, Debajyoti Mondal:
Drawing plane triangulations with few segments. Comput. Geom. 77: 27-39 (2019) - [j22]Anna Lubiw, Debajyoti Mondal:
Construction and Local Routing for Angle-Monotone Graphs. J. Graph Algorithms Appl. 23(2): 345-369 (2019) - [j21]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon simplification by minimizing convex corners. Theor. Comput. Sci. 791: 76-86 (2019) - [j20]Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and drawing of stick graphs. Theor. Comput. Sci. 796: 22-33 (2019) - [j19]Debajyoti Mondal, Manishankar Mondal, Chanchal K. Roy, Kevin A. Schneider, Yukun Li, Shisong Wang:
Clone-World: A visual analytic system for large scale software clones. Vis. Informatics 3(1): 18-26 (2019) - [c49]Debajyoti Mondal, Manishankar Mondal, Chanchal K. Roy, Kevin A. Schneider, Shisong Wang, Yukun Li:
Towards visualizing large scale evolving clones. ICSE (Companion Volume) 2019: 302-303 - [c48]Khalad Hasan, Debajyoti Mondal, Brent Thoma, Alexander Magnus:
MedGuide: a smartphone approach to guide people through important information on medicine labels. MUM 2019: 31:1-31:11 - [c47]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS 2019: 211-224 - [i17]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. CoRR abs/1903.06981 (2019) - [i16]Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid:
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR abs/1903.07024 (2019) - [i15]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. CoRR abs/1904.06760 (2019) - [i14]Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal:
Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points. CoRR abs/1910.10376 (2019) - 2018
- [j18]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. Algorithmica 80(3): 977-994 (2018) - [j17]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat
Table cartogram. Comput. Geom. 68: 174-185 (2018) - [j16]Stephane Durocher, Debajyoti Mondal:
Relating Graph Thickness to Planar Layers and Bend Complexity. SIAM J. Discret. Math. 32(4): 2703-2719 (2018) - [c46]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CCCG 2018: 54-60 - [c45]Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal:
Emanation Graph: A New t-Spanner. CCCG 2018: 311-317 - [c44]Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and Drawing of Stick Graphs. GD 2018: 303-316 - [c43]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. GD 2018: 387-401 - [c42]Debajyoti Mondal, Lev Nachmanson:
A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps. VISIGRAPP (3: IVAPP) 2018: 108-119 - [c41]Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw
Partitioning Orthogonal Histograms into Rectangular Boxes. LATIN 2018: 146-160 - [c40]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. SWAT 2018: 12:1-12:14 - [c39]Anna Lubiw, Debajyoti Mondal:
Construction and Local Routing for Angle-Monotone Graphs. WG 2018: 356-368 - [i13]Anna Lubiw, Debajyoti Mondal:
Angle-Monotone Graphs: Construction and Local Routing. CoRR abs/1801.06290 (2018) - [i12]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. CoRR abs/1802.06699 (2018) - [i11]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. CoRR abs/1803.10812 (2018) - [i10]Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal:
Minimum Shared-Power Edge Cut. CoRR abs/1806.04742 (2018) - [i9]Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and Drawing of Stick Graphs. CoRR abs/1808.10005 (2018) - [i8]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon Simplification by Minimizing Convex Corners. CoRR abs/1812.05656 (2018) - 2017
- [j15]Md. Jawaherul Alam, Stephen G. Kobourov, Debajyoti Mondal:
Orthogonal layout with optimal face complexity. Comput. Geom. 63: 40-52 (2017) - [j14]Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs. J. Graph Algorithms Appl. 21(3): 341-352 (2017) - [j13]Stephane Durocher, Debajyoti Mondal:
Drawing Planar Graphs with Reduced Height. J. Graph Algorithms Appl. 21(4): 433-453 (2017) - [c38]Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal:
Exploring Increasing-Chord Paths and Trees. CCCG 2017: 19-24 - [c37]Anna Lubiw, Debajyoti Mondal:
On Compatible Triangulations with a Minimum Number of Steiner Points. CCCG 2017: 101-106 - [c36]Therese Biedl, Debajyoti Mondal:
On Upward Drawings of Trees on a Given Grid. GD 2017: 318-325 - [i7]Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal:
Exploring Increasing-Chord Paths and Trees. CoRR abs/1702.08380 (2017) - [i6]Debajyoti Mondal, Lev Nachmanson:
A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps. CoRR abs/1705.05479 (2017) - [i5]Anna Lubiw, Debajyoti Mondal:
On Compatible Triangulations with a Minimum Number of Steiner Points. CoRR abs/1706.09086 (2017) - [i4]Debajyoti Mondal:
On String Contact Representations in 3D. CoRR abs/1707.02953 (2017) - [i3]Therese Biedl, Debajyoti Mondal:
On Upward Drawings of Trees on a Given Grid. CoRR abs/1708.09515 (2017) - [i2]Therese Biedl, Debajyoti Mondal:
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings. CoRR abs/1708.09560 (2017) - 2016
- [j12]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
Thickness and colorability of geometric graphs. Comput. Geom. 56: 1-18 (2016) - [c35]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
On the Biplanar Crossing Number of Kn. CCCG 2016: 93-100 - [c34]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal:
Polygon Simplification by Minimizing Convex Corners. COCOON 2016: 547-559 - [c33]Stephane Durocher, Debajyoti Mondal:
Relating Graph Thickness to Planar Layers and Bend Complexity. ICALP 2016: 10:1-10:13 - [c32]David Eppstein, Philipp Kindermann
On the Planar Split Thickness of Graphs. LATIN 2016: 403-415 - [c31]Muhammad Jawaherul Alam, Stephen G. Kobourov
Orthogonal Layout with Optimal Face Complexity. SOFSEM 2016: 121-133 - [i1]Stephane Durocher, Debajyoti Mondal:
Relating Graph Thickness to Planar Layers and Bend Complexity. CoRR abs/1602.07816 (2016) - 2015
- [j11]Stephane Durocher, Debajyoti Mondal:
Plane 3-Trees: Embeddability and Approximation. SIAM J. Discret. Math. 29(1): 405-420 (2015) - [j10]Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman
On graphs that are not PCGs. Theor. Comput. Sci. 571: 78-87 (2015) - [c30]Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, Sue Whitesides:
Reconfiguring a Chain of Cubes. CCCG 2015 - [c29]Debajyoti Mondal, Hadi Hemmati, Stephane Durocher:
Exploring Test Suite Diversification and Code Coverage in Multi-Objective Test Case Selection. ICST 2015: 1-10 - [c28]Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. SOFSEM 2015: 140-151 - 2014
- [c27]Stephane Durocher, Debajyoti Mondal:
Drawing Plane Triangulations with Few Segments, pp. 40-45. CCCG 2014 - [c26]Stephane Durocher, Robert Fraser, Travis Gagie
Indexed Geometric Jumbled Pattern Matching. CPM 2014: 110-119 - [c25]Stephane Durocher, Debajyoti Mondal:
Trade-Offs in Planar Polyline Drawings. GD 2014: 306-318 - [c24]Stephane Durocher, Debajyoti Mondal:
Drawing Planar Graphs with Reduced Height. GD 2014: 392-403 - [c23]Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal:
Drawing HV-Restricted Planar Graphs. LATIN 2014: 156-167 - 2013
- [j9]Debajyoti Mondal, Rahnuma Islam Nishat
Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Optim. 25(3): 460-480 (2013) - [j8]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic coloring with few division vertices. J. Discrete Algorithms 23: 42-53 (2013) - [j7]Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman
Universal Line-Sets for Drawing Planar 3-Trees. J. Graph Algorithms Appl. 17(2): 59-79 (2013) - [j6]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat
A Note on Minimum-Segment Drawings of Planar Graphs. J. Graph Algorithms Appl. 17(3): 301-328 (2013) - [c22]Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid:
On k-Enclosing Objects in a Coloured Point Set. CCCG 2013 - [c21]Debajyoti Mondal, Yang Wang, Stephane Durocher:
Robust Solvers for Square Jigsaw Puzzles. CRV 2013: 249-256 - [c20]William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov
Table Cartograms. ESA 2013: 421-432 - [c19]Stephane Durocher, Debajyoti Mondal:
On Balanced ✛-Contact Representations. GD 2013: 143-154 - [c18]William J. Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat
Planar and Plane Slope Number of Partial 2-Trees. GD 2013: 412-423 - [c17]Stephane Durocher, Debajyoti Mondal:
Plane 3-trees: Embeddability and Approximation - (Extended Abstract). WADS 2013: 291-303 - [c16]Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman
On Graphs That Are Not PCGs. WALCOM 2013: 310-321 - [c15]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
Thickness and Colorability of Geometric Graphs. WG 2013: 237-248 - 2012
- [j5]Rahnuma Islam Nishat
Point-set embeddings of plane 3-trees. Comput. Geom. 45(3): 88-98 (2012) - [j4]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic colorings of graph subdivisions revisited. J. Discrete Algorithms 16: 90-103 (2012) - [j3]Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey
Cool-lex order and k-ary Catalan structures. J. Discrete Algorithms 16: 287-307 (2012) - [c14]Sudip Biswas, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat
Hamiltonian Paths and Cycles in Planar Graphs. COCOA 2012: 83-94 - [c13]Stephen G. Kobourov
Touching Triangle Representations for 3-Connected Planar Graphs. GD 2012: 199-210 - [c12]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic Coloring with Few Division Vertices. IWOCA 2012: 86-99 - [c11]Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman
Universal Line-Sets for Drawing Planar 3-Trees. WALCOM 2012: 136-147 - [c10]Stephane Durocher, Debajyoti Mondal:
On the Hardness of Point-Set Embeddability - (Extended Abstract). WALCOM 2012: 148-159 - 2011
- [j2]Debajyoti Mondal, Rahnuma Islam Nishat
Minimum-Area Drawings of Plane 3-Trees. J. Graph Algorithms Appl. 15(2): 177-204 (2011) - [j1]Rahnuma Islam Nishat
Visibility Drawings of Plane 3-Trees with Minimum Area. Math. Comput. Sci. 5(1): 119-132 (2011) - [c9]Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, Matthew Skala:
Realizing Site Permutations. CCCG 2011 - [c8]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides:
A Note on Minimum-Segment Drawings of Planar Graphs. CCCG 2011 - [c7]Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat
Embedding Plane 3-Trees in ℝ2 and ℝ3. GD 2011: 39-51 - [c6]Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams:
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. IWOCA 2011: 182-194 - [c5]Debajyoti Mondal, Rahnuma Islam Nishat
Acyclic Colorings of Graph Subdivisions. IWOCA 2011: 247-260 - [c4]Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman
Minimum-Layer Drawings of Trees - (Extended Abstract). WALCOM 2011: 221-232 - 2010
- [c3]Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Md. Jawaherul Alam:
Minimum-area drawings of plane 3-trees. CCCG 2010: 191-194 - [c2]Sudip Biswas, Debajyoti Mondal, Rahnuma Islam Nishat
Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs. COCOON 2010: 182-191 - [c1]Rahnuma Islam Nishat
Point-Set Embeddings of Plane 3-Trees - (Extended Abstract). GD 2010: 317-328
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: