Debajyoti Mondal

Orcid: 0000-0002-7370-8697

According to our database1, Debajyoti Mondal authored at least 103 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Relating planar graph drawings to planar satisfiability problems.
Inf. Process. Lett., February, 2024

2023
Drawing Partial 2-Trees with Few Slopes.
Algorithmica, May, 2023

Explainable deep learning in plant phenotyping.
Frontiers Artif. Intell., February, 2023

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set.
Int. J. Comput. Geom. Appl., 2023

Emanation Graph: A Plane Geometric Spanner with Steiner Points.
Graphs Comb., 2023

Improved and Generalized Algorithms for Burning a Planar Point Set.
Proceedings of the WALCOM: Algorithms and Computation, 2023

Minimum Ply Covering of Points with Unit Squares.
Proceedings of the WALCOM: Algorithms and Computation, 2023

TransClone: A Language Agnostic Code Clone Detector.
Proceedings of the 17th IEEE International Workshop on Software Clones, 2023

Pathways to Leverage Transcompiler based Data Augmentation for Cross-Language Clone Detection.
Proceedings of the 31st IEEE/ACM International Conference on Program Comprehension, 2023

BigGraphVis: Visualizing Communities in Big Graphs Leveraging GPU-Accelerated Streaming Algorithms.
Proceedings of the 18th International Joint Conference on Computer Vision, 2023

Integrating Visual Aids to Enhance the Code Reviewer Selection Process.
Proceedings of the IEEE International Conference on Software Maintenance and Evolution, 2023

Finding a Maximum Clique in a Disk Graph.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

Investigating Technology Usage Span by Analyzing Users' Q&A Traces in Stack Overflow.
Proceedings of the 30th Asia-Pacific Software Engineering Conference, 2023

2022
APX-hardness and approximation for the <i>k</i>-burning number problem.
Theor. Comput. Sci., 2022

Positive planar satisfiability problems under 3-connectivity constraints.
Theor. Comput. Sci., 2022

Parameterized complexity of two-interval pattern problem.
Theor. Comput. Sci., 2022

The Complexity of Drawing a Graph in a Polygonal Region.
J. Graph Algorithms Appl., 2022

Finding a Maximum Clique in a Grounded 1-Bend String Graph.
J. Graph Algorithms Appl., 2022

Leveraging Guided Backpropagation to Select Convolutional Neural Networks for Plant Classification.
Frontiers Artif. Intell., 2022

Token Swapping on Trees.
Discret. Math. Theor. Comput. Sci., 2022

Oriented Diameter of Planar Triangulations.
CoRR, 2022

Computing maximum independent set on outerstring graphs and their relatives.
Comput. Geom., 2022

Leveraging structural properties of source code graphs for just-in-time bug prediction.
Autom. Softw. Eng., 2022

StreamTable: An Area Proportional Visualization for Tables with Flowing Streams.
Proceedings of the WALCOM: Algorithms and Computation, 2022

Feature Transformation for Improved Software Bug Detection Models.
Proceedings of the ISEC 2022: 15th Innovations in Software Engineering Conference, Gandhinagar, India, February 24, 2022

Bounds for the Oriented Diameter of Planar Triangulations.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Burning Number for the Points in the Plane.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

SET-STAT-MAP: Extending Parallel Sets for Visualizing Mixed Data.
Proceedings of the 15th IEEE Pacific Visualization Symposium, 2022

2021
Simultaneous Embedding of Colored Graphs.
Graphs Comb., 2021

BigGraphVis: Leveraging Streaming Algorithms and GPU Acceleration for Visualizing Big Graphs.
CoRR, 2021

On the Evolution of Neuron Communities in a Deep Learning Architecture.
CoRR, 2021

APX-Hardness and Approximation for the k-Burning Number Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Faster Multi-sided One-Bend Boundary Labelling.
Proceedings of the WALCOM: Algorithms and Computation, 2021

ContourDiff: Revealing Differential Trends in Spatiotemporal Data.
Proceedings of the 25th International Conference Information Visualisation, 2021

Putting Table Cartograms into Practice.
Proceedings of the Advances in Visual Computing - 16th International Symposium, 2021

Visualizing Feature Maps for Model Selection in Convolutional Neural Networks.
Proceedings of the IEEE/CVF International Conference on Computer Vision Workshops, 2021

2020
On compatible triangulations with a minimum number of Steiner points.
Theor. Comput. Sci., 2020

Minimum shared-power edge cut.
Networks, 2020

Local Routing in Convex Subdivisions.
Int. J. Comput. Geom. Appl., 2020

(Faster) Multi-Sided Boundary Labelling.
CoRR, 2020

Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Scope and Impact of Visualization in Training Professionals in Academic Medicine.
Proceedings of the 45th Graphics Interface Conference 2020, 2020

Finding a Maximum Clique in a Grounded 1-Bend String Graph.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Data Reduction and Deep-Learning Based Recovery for Geospatial Visualization and Satellite Imagery.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

Tracing shapes with eyes: design and evaluation of an eye tracking based approach.
Proceedings of the AH '20: 11th Augmented Human International Conference, 2020

An exploration of rules and tools for family members to limit co-located smartphone usage.
Proceedings of the AH '20: 11th Augmented Human International Conference, 2020

2019
Clone-World: A visual analytic system for large scale software clones.
Vis. Informatics, 2019

Recognition and drawing of stick graphs.
Theor. Comput. Sci., 2019

Polygon simplification by minimizing convex corners.
Theor. Comput. Sci., 2019

Construction and Local Routing for Angle-Monotone Graphs.
J. Graph Algorithms Appl., 2019

Drawing plane triangulations with few segments.
Comput. Geom., 2019

MedGuide: a smartphone approach to guide people through important information on medicine labels.
Proceedings of the 18th International Conference on Mobile and Ubiquitous Multimedia, 2019

Towards visualizing large scale evolving clones.
Proceedings of the 41st International Conference on Software Engineering: Companion Proceedings, 2019

2018
Relating Graph Thickness to Planar Layers and Bend Complexity.
SIAM J. Discret. Math., 2018

Angle-Monotone Graphs: Construction and Local Routing.
CoRR, 2018

Table cartogram.
Comput. Geom., 2018

On the Planar Split Thickness of Graphs.
Algorithmica, 2018

Boundary Labeling for Rectangular Diagrams.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Partitioning Orthogonal Histograms into Rectangular Boxes.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps.
Proceedings of the 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2018), 2018

Emanation Graph: A New t-Spanner.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Compatible Paths on Labelled Point Sets.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs.
J. Graph Algorithms Appl., 2017

Drawing Planar Graphs with Reduced Height.
J. Graph Algorithms Appl., 2017

A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings.
CoRR, 2017

On String Contact Representations in 3D.
CoRR, 2017

Orthogonal layout with optimal face complexity.
Comput. Geom., 2017

On Upward Drawings of Trees on a Given Grid.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Exploring Increasing-Chord Paths and Trees.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Thickness and colorability of geometric graphs.
Comput. Geom., 2016

On the Biplanar Crossing Number of K<sub>n</sub>.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
On graphs that are not PCGs.
Theor. Comput. Sci., 2015

Plane 3-Trees: Embeddability and Approximation.
SIAM J. Discret. Math., 2015

Exploring Test Suite Diversification and Code Coverage in Multi-Objective Test Case Selection.
Proceedings of the 8th IEEE International Conference on Software Testing, 2015

Reconfiguring a Chain of Cubes.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Drawing HV-Restricted Planar Graphs.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Trade-Offs in Planar Polyline Drawings.
Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Indexed Geometric Jumbled Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Drawing Plane Triangulations with Few Segments, pp. 40-45.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Universal Line-Sets for Drawing Planar 3-Trees.
J. Graph Algorithms Appl., 2013

A Note on Minimum-Segment Drawings of Planar Graphs.
J. Graph Algorithms Appl., 2013

Acyclic coloring with few division vertices.
J. Discrete Algorithms, 2013

Minimum-segment convex drawings of 3-connected cubic plane graphs.
J. Comb. Optim., 2013

Plane 3-trees: Embeddability and Approximation - (Extended Abstract).
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Planar and Plane Slope Number of Partial 2-Trees.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

On Balanced ✛-Contact Representations.
Proceedings of the Graph Drawing - 21st International Symposium, 2013


Robust Solvers for Square Jigsaw Puzzles.
Proceedings of the Tenth Conference on Computer and Robot Vision, 2013

On k-Enclosing Objects in a Coloured Point Set.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Acyclic colorings of graph subdivisions revisited.
J. Discrete Algorithms, 2012

Cool-lex order and k-ary Catalan structures.
J. Discrete Algorithms, 2012

Point-set embeddings of plane 3-trees.
Comput. Geom., 2012

On the Hardness of Point-Set Embeddability - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Touching Triangle Representations for 3-Connected Planar Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Hamiltonian Paths and Cycles in Planar Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Visibility Drawings of Plane 3-Trees with Minimum Area.
Math. Comput. Sci., 2011

Minimum-Area Drawings of Plane 3-Trees.
J. Graph Algorithms Appl., 2011

Minimum-Layer Drawings of Trees - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Acyclic Colorings of Graph Subdivisions.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Embedding Plane 3-Trees in ℝ2 and ℝ3.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Realizing Site Permutations.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Point-Set Embeddings of Plane 3-Trees - (Extended Abstract).
Proceedings of the Graph Drawing - 18th International Symposium, 2010


  Loading...