default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMuhammad Jawaherul Alam
Person information
- affiliation: University of Arizona, Tucson, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Jawaherul Md. Alam, Michael A. Bekos
, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. Algorithmica 85(5): 1176-1201 (2023)- 2022
- [j16]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
The mixed page number of graphs. Theor. Comput. Sci. 931: 131-141 (2022) - 2021
- [j15]Muhammad Jawaherul Alam, Michael A. Bekos, Vida Dujmovic, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On dispersable book embeddings. Theor. Comput. Sci. 861: 1-22 (2021) - [i18]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
The Mixed Page Number of Graphs. CoRR abs/2107.04993 (2021) - 2020
- [j14]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. Algorithmica 82(9): 2564-2585 (2020) - [c29]Sabrina Nusrat, Muhammad Jawaherul Alam, Stephen G. Kobourov:
Recognition and Recall of Geographic Data In Cartograms. AVI 2020: 29:1-29:9 - [c28]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. GD 2020: 55-68 - [i17]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. CoRR abs/2008.10336 (2020)
2010 – 2019
- 2018
- [j13]Sabrina Nusrat, Md. Jawaherul Alam, Stephen G. Kobourov:
Evaluating Cartogram Effectiveness. IEEE Trans. Vis. Comput. Graph. 24(2): 1077-1090 (2018) - [j12]Sabrina Nusrat, Muhammad Jawaherul Alam, Carlos Scheidegger, Stephen G. Kobourov:
Cartogram Visualization for Bivariate Geo-Statistical Data. IEEE Trans. Vis. Comput. Graph. 24(10): 2675-2688 (2018) - [c27]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Queue Layouts of Planar 3-Trees. GD 2018: 213-226 - [c26]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. WG 2018: 1-14 - [i16]Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. CoRR abs/1803.10030 (2018) - 2017
- [j11]Md. Jawaherul Alam, Stephen G. Kobourov, Debajyoti Mondal:
Orthogonal layout with optimal face complexity. Comput. Geom. 63: 40-52 (2017) - [j10]Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Threshold-coloring and unit-cube contact representation of planar graphs. Discret. Appl. Math. 216: 2-14 (2017) - 2016
- [j9]Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
On some properties of doughnut graphs. AKCE Int. J. Graphs Comb. 13(2): 130-139 (2016) - [c25]Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev:
The Bundled Crossing Number. GD 2016: 399-412 - [c24]Muhammad Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov:
On Contact Graphs with Cubes and Proportional Boxes. SOFSEM 2016: 107-120 - [c23]Muhammad Jawaherul Alam, Stephen G. Kobourov, Debajyoti Mondal:
Orthogonal Layout with Optimal Face Complexity. SOFSEM 2016: 121-133 - [c22]Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson:
J-Viz: Finding algorithmic complexity attacks via graph visualization of Java bytecode. VizSEC 2016: 1-8 - [i15]Md. Jawaherul Alam, Michael B. Dillencourt, Michael T. Goodrich:
Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments. CoRR abs/1608.03943 (2016) - [i14]Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev:
The Bundled Crossing Number. CoRR abs/1608.08161 (2016) - [i13]Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson:
J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode. CoRR abs/1608.08970 (2016) - 2015
- [j8]Md. Jawaherul Alam, Stephen G. Kobourov, Sankar Veeramoni:
Quantitative Measures for Cartogram Generation Techniques. Comput. Graph. Forum 34(3): 351-360 (2015) - [j7]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze:
Fitting Planar Graphs on Planar Maps. J. Graph Algorithms Appl. 19(1): 413-440 (2015) - [c21]Md. Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. GD 2015: 472-486 - [c20]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Graphs of Circular Arcs. WADS 2015: 1-13 - [c19]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Contact Representations of Graphs in 3D. WADS 2015: 14-27 - [c18]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Weak Unit Disk and Interval Representation of Graphs. WG 2015: 237-251 - [i12]Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt:
Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. CoRR abs/1501.00304 (2015) - [i11]Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt:
Contact Representations of Sparse Planar Graphs. CoRR abs/1501.00318 (2015) - [i10]Sabrina Nusrat, Md. Jawaherul Alam, Stephen G. Kobourov:
Evaluating Cartogram Effectiveness. CoRR abs/1504.02218 (2015) - [i9]Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt, Alexander Wolff:
Pixel and Voxel Representations of Graphs. CoRR abs/1507.01450 (2015) - [i8]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov:
On Contact Graphs with Cubes and Proportional Boxes. CoRR abs/1510.02484 (2015) - [i7]Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov:
On the Book Thickness of 1-Planar Graphs. CoRR abs/1510.05891 (2015) - 2014
- [c17]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Happy Edges: Threshold-Coloring of Regular Lattices. FUN 2014: 28-39 - [c16]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev:
Balanced Circle Packings for Planar Graphs. GD 2014: 125-136 - [c15]Md. Jawaherul Alam, Stephen G. Kobourov, Giuseppe Liotta, Sergey Pupyrev, Sankar Veeramoni:
3D proportional contact representations of graphs. IISA 2014: 27-32 - [c14]Muhammad Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff:
Smooth Orthogonal Drawings of Planar Graphs. LATIN 2014: 144-155 - [c13]Md. Jawaherul Alam, Michael Kaufmann, Stephen G. Kobourov, Tamara Mchedlidze:
Fitting Planar Graphs on Planar Maps. SOFSEM 2014: 52-64 - [i6]Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev:
Balanced Circle Packings for Planar Graphs. CoRR abs/1408.4902 (2014) - [i5]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Weak Unit Disk and Interval Representation of Planar Graphs. CoRR abs/1408.6928 (2014) - 2013
- [j6]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov:
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations. Algorithmica 67(1): 3-22 (2013) - [j5]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. Discret. Comput. Geom. 50(3): 784-810 (2013) - [c12]Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov:
Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. GD 2013: 83-94 - [c11]Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold-Coloring and Unit-Cube Contact Representation of Graphs. WG 2013: 26-37 - [i4]Md. Jawaherul Alam, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev:
Threshold Coloring and Unit-Cube Contact Representation of Graphs. CoRR abs/1302.6183 (2013) - [i3]Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter:
Threshold-Coloring of Archimedean and Laves Lattices. CoRR abs/1306.2053 (2013) - [i2]Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff:
Smooth Orthogonal Drawings of Planar Graphs. CoRR abs/1312.3538 (2013) - 2012
- [j4]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov:
Proportional Contact Representations of Planar Graphs. J. Graph Algorithms Appl. 16(3): 701-728 (2012) - [c10]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing cartograms with optimal complexity. SCG 2012: 21-30 - [c9]Md. Jawaherul Alam, Stephen G. Kobourov:
Proportional Contact Representations of 4-Connected Planar Graphs. GD 2012: 211-223 - [c8]Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
On Some Properties of Doughnut Graphs. IWOCA 2012: 60-64 - [i1]Md. Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt:
Computing Cartograms with Optimal Complexity. CoRR abs/1201.0066 (2012) - 2011
- [j3]Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Muhammad Jawaherul Alam:
Minimum-Area Drawings of Plane 3-Trees. J. Graph Algorithms Appl. 15(2): 177-204 (2011) - [j2]Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area. J. Graph Algorithms Appl. 15(3): 437-456 (2011) - [c7]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov:
Proportional Contact Representations of Planar Graphs. GD 2011: 26-38 - [c6]Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov:
Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations. ISAAC 2011: 281-291 - [c5]Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman:
Minimum-Layer Drawings of Trees - (Extended Abstract). WALCOM 2011: 221-232 - 2010
- [j1]Muhammad Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman:
Minimum-Layer Upward Drawings of Trees. J. Graph Algorithms Appl. 14(2): 245-267 (2010) - [c4]Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Md. Jawaherul Alam:
Minimum-area drawings of plane 3-trees. CCCG 2010: 191-194
2000 – 2009
- 2009
- [c3]Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract). WALCOM 2009: 310-321 - 2008
- [c2]Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman:
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. GD 2008: 408-419 - [c1]Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman:
Upward Drawings of Trees on the Minimum Number of Layers. WALCOM 2008: 88-99
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-04-25 05:56 CEST 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:
