default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Abello
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c34]James Abello, Timothy R. Tangherlini
, Haoyang Zhang:
A Max Flow Min Cut View of Social Media Posts. DATA 2024: 190-201- 2023
- [c33]James Abello, Haoyang Zhang:
Graph Peeling Semantics. EDBT/ICDT Workshops 2023 - 2022
- [j20]James Abello, Daniel Nakhimovich:
Graph Waves. Big Data Res. 29: 100327 (2022) - [j19]James Abello, Haoyang Zhang, Daniel Nakhimovich, Chengguizi Han, Mridul Aanjaneya:
Giga Graph Cities: Their Buckets, Buildings, Waves, and Fragments. IEEE Computer Graphics and Applications 42(3): 53-64 (2022) - 2021
- [c32]James Abello, Daniel Nakhimovich, Chengguizi Han, Mridul Aanjaneya:
Graph Cities: Their Buildings, Waves, and Fragments. EDBT/ICDT Workshops 2021 - 2020
- [c31]James Abello, Daniel Nakhimovich:
Graph Waves. EDBT/ICDT Workshops 2020
2010 – 2019
- 2019
- [c30]James Abello, Fred Hohman, Varun Bezzam, Duen Horng Chau:
Atlas: local graph exploration in a global context. IUI 2019: 165-176 - [p1]James Abello, Daniel Mawhirter, Kevin Sun:
Taming a Graph Hairball: Local Exploration in a Global Context. Business and Consumer Analytics: New Ideas 2019: 467-490 - 2018
- [i3]James Abello, Fred Hohman, Varun Bezzam, Duen Horng Chau:
Large Graph Exploration via Subgraph Discovery and Decomposition. CoRR abs/1808.04414 (2018) - 2017
- [j18]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
MSOL restricted contractibility to planar graphs. Theor. Comput. Sci. 676: 1-14 (2017) - [c29]Robert S. Pienta, Minsuk Kahng, Zhiyuan Lin, Jilles Vreeken, Partha P. Talukdar, James Abello, Ganesh Parameswaran, Duen Horng Chau:
FACETS: Adaptive Local Exploration of Large Graphs. SDM 2017: 597-605 - 2015
- [c28]Robert S. Pienta, James Abello, Minsuk Kahng, Duen Horng Chau:
Scalable graph exploration and visualization: Sensemaking challenges and opportunities. BigComp 2015: 271-278 - [c27]Brian Thompson, James Abello:
Efficient and Time Scale-Invariant Detection of Correlated Activity in Communication Networks. ICDM Workshops 2015: 532-539 - [i2]Robert S. Pienta, Zhiyuan Lin, Minsuk Kahng, Jilles Vreeken, Partha P. Talukdar, James Abello, Ganesh Parameswaran, Duen Horng Chau:
Seeing the Forest through the Trees: Adaptive Local Exploration of Large Graphs. CoRR abs/1505.06792 (2015) - 2014
- [j17]James Abello, François Queyroi:
Network decomposition into fixed points of degree peeling. Soc. Netw. Anal. Min. 4(1): 191 (2014) - [j16]James Abello, Steffen Hadlak, Heidrun Schumann, Hans-Jörg Schulz:
A Modular Degree-of-Interest Specification for the Visual Analysis of Large Dynamic Networks. IEEE Trans. Vis. Comput. Graph. 20(3): 337-350 (2014) - 2013
- [c26]James Abello, François Queyroi:
Fixed points of graph peeling. ASONAM 2013: 256-263 - [c25]Daniel Archambault, James Abello, Jessie Kennedy, Stephen G. Kobourov, Kwan-Liu Ma, Silvia Miksch, Chris Muelder, Alexandru C. Telea:
Temporal Multivariate Networks. Multivariate Network Visualization 2013: 151-174 - 2012
- [j15]James Abello, Peter Broadwell, Timothy R. Tangherlini:
Computational folkloristics. Commun. ACM 55(7): 60-70 (2012) - [c24]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
MSOL Restricted Contractibility to Planar Graphs. IPEC 2012: 194-205 - [i1]James Abello, Pavel Klavík, Jan Kratochvíl, Tomás Vyskocil:
Matching and l-Subgraph Contractibility to Planar Graphs. CoRR abs/1204.6070 (2012) - 2010
- [c23]James Abello, Tina Eliassi-Rad, Nishchal Devanur:
Detecting Novel Discrepancies in Communication Networks. ICDM 2010: 8-17
2000 – 2009
- 2009
- [j14]Christian Tominski, James Abello, Heidrun Schumann:
CGV - An interactive graph visualization system. Comput. Graph. 33(6): 660-678 (2009) - 2006
- [j13]James Abello, Frank van Ham, Neeraj Krishnan:
ASK-GraphView: A Large Scale Graph Visualization System. IEEE Trans. Vis. Comput. Graph. 12(5): 669-676 (2006) - [c22]Christian Tominski, James Abello, Frank van Ham, Heidrun Schumann:
Fisheye Tree Views and Lenses for Graph Visualization. IV 2006: 17-24 - 2005
- [e1]James Abello, Graham Cormode:
Discrete Methods in Epidemiology, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 18-19, 2004. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 70, DIMACS/AMS 2005, ISBN 978-0-8218-4379-6 [contents] - 2004
- [j12]James Abello:
Hierarchical graph maps. Comput. Graph. 28(3): 345-359 (2004) - [j11]James Abello, Alex J. Pogel, Lance Miller:
Breadth First Search Graph Partitions and Concept Lattices. J. Univers. Comput. Sci. 10(8): 934-954 (2004) - [c21]James Abello, Graham Cormode, Dmitriy Fradkin, David Madigan, Ofer Melnik, Ilya B. Muchnik:
Selected Data Mining Concepts. Discrete Methods in Epidemiology 2004: 1-40 - [c20]James Abello, Alex J. Pogel:
Graph Partitions and Concept Lattices. Discrete Methods in Epidemiology 2004: 115-138 - [c19]James Abello, Michael Capalbo:
Random Graphs (and the Spread of Infections in a Social Network). Discrete Methods in Epidemiology 2004: 215-223 - [c18]James Abello, Stephen G. Kobourov, Roman Yusufov:
Visualizing Large Graphs with Compound-Fisheye Views and Treemaps. GD 2004: 431-441 - [c17]James Abello, Frank van Ham:
Matrix Zoom: A Visual Interface to Semi-External Graphs. INFOVIS 2004: 183-190 - [c16]Christian Tominski, James Abello, Heidrun Schumann:
Axes-based visualizations with radial layouts. SAC 2004: 1242-1247 - 2003
- [c15]James Abello, Yannis Kotidis:
Hierarchical graph indexing. CIKM 2003: 453-460 - 2002
- [j10]James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
A Functional Approach to External Graph Algorithms. Algorithmica 32(3): 437-458 (2002) - [j9]James Abello, Krishna Kumar:
Visibility Graphs and Oriented Matroids. Discret. Comput. Geom. 28(4): 449-465 (2002) - [j8]James Abello, Jeffrey L. Korn:
MGV: A System for Visualizing Massive Multidigraphs. IEEE Trans. Vis. Comput. Graph. 8(1): 21-38 (2002) - [c14]James Abello, Jeffrey L. Korn, Matthias Kreuseler:
Navigating Giga-Graphs. AVI 2002: 290-299 - [c13]James Abello, Mauricio G. C. Resende, Sandra Sudarsky:
Massive Quasi-Clique Detection. LATIN 2002: 598-612 - [c12]Jop F. Sibeyn, James Abello, Ulrich Meyer:
Heuristics for semi-external depth first search on directed graphs. SPAA 2002: 282-292 - 2001
- [j7]James Abello, Sergiy Butenko, Panos M. Pardalos, Mauricio G. C. Resende:
Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21(2): 111-137 (2001) - [c11]James Abello, Irene Finocchi, Jeffrey L. Korn:
Graph Sketches. INFOVIS 2001: 67-72 - 2000
- [c10]James Abello, Jeffrey L. Korn:
Visualizing Massive Multi-Digraphs. INFOVIS 2000: 39-47
1990 – 1999
- 1998
- [j6]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia:
Illumination of Orthogonal Polygons with Orthogonal Floodlights. Int. J. Comput. Geom. Appl. 8(1): 25-38 (1998) - [c9]James Abello, Panos M. Pardalos, Mauricio G. C. Resende:
On maximum clique problems in very large graphs. External Memory Algorithms 1998: 119-130 - [c8]James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
A Functional Approach to External Graph Algorithms. ESA 1998: 332-343 - [c7]James Abello, Emden R. Gansner:
Short and Smooth Polygonal Paths. LATIN 1998: 151-162 - 1997
- [j5]James Abello, Shlomi Dolev:
On the Computational Power of Self-Stabilizing Systems. Theor. Comput. Sci. 182(1-2): 159-170 (1997) - 1995
- [j4]James Abello, Ömer Egecioglu, Krishna Kumar:
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. Discret. Comput. Geom. 14(3): 331-358 (1995) - [c6]James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia:
Illumination with Orthogonal Floodlights. ISAAC 1995: 362-371 - [c5]James Abello, Krishna Kumar:
Visibility Graphs of 2-Spiral Polygons (Extended Abstract). LATIN 1995: 1-15 - 1994
- [c4]James Abello, Krishna Kumar:
Visibility Graphs and Oriented Matroids. GD 1994: 147-158 - 1993
- [j3]James Abello, Ömer Egecioglu:
Visibility graphs of staircase polygons with uniform step length. Int. J. Comput. Geom. Appl. 3(1): 27-37 (1993) - [c3]James Abello, Krishna Kumar, Ömer Egecioglu:
A Combinatorial View of Visibility Graphs of Simple Polygons. ICCI 1993: 87-92 - [c2]James Abello, Anne Houang, James Russell:
A Hierarchy of Pattern Recognition Algorithms for the Diagnosis of Sucker Rod Pumped Wells. ICCI 1993: 359-364 - 1992
- [c1]James Abello, Sandra Sudarsky, T. Veatch, J. Waller:
AGE: An Animated Graph Environment. Computational Support for Discrete Mathematics 1992: 57-69 - 1991
- [j2]James Abello, Michael R. Fellows, John Stillwell:
On the complexity and combinatorics of covering finite complexes. Australas. J Comb. 4: 103-112 (1991) - [j1]James Abello:
The Weak Bruhat Order of SSigma, Consistent Sets, and Catalan Numbers. SIAM J. Discret. Math. 4(1): 1-16 (1991)
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-07 21:19 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:
