default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Suderman
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j8]Josine L. Min
, Gibran Hemani, George Davey Smith, Caroline Relton, Matthew Suderman:
Meffil: efficient normalization and analysis of very large DNA methylation datasets. Bioinform. 34(23): 3983-3989 (2018)
2000 – 2009
- 2007
- [j7]Matthew Suderman, Michael T. Hallett:
Tools for visually exploring biological networks. Bioinform. 23(20): 2651-2659 (2007) - [j6]Vida Dujmovic, Matthew Suderman, David R. Wood:
Graph drawings with few slopes. Comput. Geom. 38(3): 181-193 (2007) - [j5]Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood:
Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3): 194-212 (2007) - [c10]James P. Delgrande, Francis Jeffry Pelletier, Matthew Suderman:
Compositional Belief Update. FLAIRS 2007: 68-73 - 2006
- [j4]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006) - [j3]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
k-Spine, 1-bend planarity. Theor. Comput. Sci. 359(1-3): 148-175 (2006) - 2005
- [j2]Matthew Suderman, Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. J. Graph Algorithms Appl. 9(1): 149-163 (2005) - [c9]Matthew Suderman:
Proper and Planar Drawings of Graphs on Three Layers. GD 2005: 434-445 - 2004
- [j1]Matthew Suderman:
Pathwidth And Layered Drawings Of Trees. Int. J. Comput. Geom. Appl. 14(3): 203-225 (2004) - [c8]Vida Dujmovic, Matthew Suderman, David R. Wood:
Really Straight Graph Drawings. GD 2004: 122-132 - [c7]Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. GD 2004: 262-272 - 2003
- [c6]Matthew Suderman, Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. GD 2003: 345-356 - 2002
- [c5]James P. Delgrande, Matthew Suderman:
Considerations on compositional update operators. NMR 2002: 150-159 - 2001
- [c4]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499 - [c3]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to Two-Layer Planarization. GD 2001: 1-15 - 2000
- [c2]Matthew Suderman, James P. Delgrande:
Considerations on Compositional Update Operators. AI 2000: 411-420 - [c1]Arthur L. Liestman, Thomas C. Shermer, Matthew J. Suderman:
Broadcasting Multiple Messages in Hypercubes (preliminary version). ISPAN 2000: 274-281
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 2025-03-04 22:14 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:
