default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVance Faber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Vance Faber
, Noah Streib:
Network routing on regular digraphs and their line graphs. J. Sched. 27(6): 557-564 (2024)- 2022
- [i7]Nyumbu Chishwashwa, Vance Faber, Noah Streib:
Digraph Networks and Groupoids. CoRR abs/2208.10537 (2022) - [i6]Vance Faber, Jörg Liesen, Petr Tichý:
On the Forsythe conjecture. CoRR abs/2209.14579 (2022) - 2020
- [j26]Paul Burkhardt, Vance Faber, David G. Harris:
Bounds and algorithms for graph trusses. J. Graph Algorithms Appl. 24(3): 191-214 (2020)
2010 – 2019
- 2019
- [j25]Vance Faber, David G. Harris:
Edge-coloring linear hypergraphs with medium-sized edges. Random Struct. Algorithms 55(1): 153-159 (2019) - 2018
- [i5]Paul Burkhardt, Vance Faber, David G. Harris:
Bounds and algorithms for k-truss. CoRR abs/1806.05523 (2018) - 2014
- [i4]Vance Faber:
Transpose on vertex symmetric digraphs. CoRR abs/1407.0958 (2014) - 2013
- [j24]Vance Faber, Jörg Liesen, Petr Tichý:
Properties of Worst-Case GMRES. SIAM J. Matrix Anal. Appl. 34(4): 1500-1519 (2013) - [i3]Vance Faber:
Global communication algorithms for Cayley graphs. CoRR abs/1305.6349 (2013) - 2012
- [i2]Vance Faber:
Global sum on symmetric networks. CoRR abs/1201.4153 (2012) - [i1]Vance Faber:
Livelock free routing schemes. CoRR abs/1201.4524 (2012) - 2011
- [j23]Michael Hawrylycz, Lydia Ng, Damon Page, John Morris, Christopher Lau, Sky Faber, Vance Faber, Susan Sunkin, Vilas Menon, Ed S. Lein, Allan Jones:
Multi-scale correlation structure of gene expression in the brain. Neural Networks 24(9): 933-942 (2011) - [j22]Vance Faber:
Review of chromatic graph theory by Gary Chartrand and Ping Zhang. SIGACT News 42(3): 23-28 (2011) - 2010
- [j21]Vance Faber, Jörg Liesen, Petr Tichý:
On Chebyshev Polynomials of Matrices. SIAM J. Matrix Anal. Appl. 31(4): 2205-2221 (2010)
2000 – 2009
- 2009
- [j20]Vance Faber, Jörg Liesen, Petr Tichý:
On orthogonal reduction to Hessenberg form with small bandwidth. Numer. Algorithms 51(2): 133-142 (2009) - 2008
- [j19]Vance Faber, Jörg Liesen, Petr Tichý:
The Faber-Manteuffel Theorem for Linear Operators. SIAM J. Numer. Anal. 46(3): 1323-1337 (2008) - 2004
- [j18]Randall Dougherty, Vance Faber, Michael Murphy:
Unflippable Tetrahedral Complexes. Discret. Comput. Geom. 32(3): 309-315 (2004) - [j17]Randall Dougherty, Vance Faber:
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. SIAM J. Discret. Math. 17(3): 478-519 (2004) - 2003
- [j16]Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist:
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. J. Graph Algorithms Appl. 7(1): 3-31 (2003) - 2001
- [c6]Artem Mikheev, Luc Vincent, Vance Faber:
High-Quality Polygonal Contour Approximation Based on Relaxation. ICDAR 2001: 361-367 - [c5]Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist:
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. WAE 2001: 172-184
1990 – 1999
- 1999
- [j15]Qiang Du, Vance Faber, Max D. Gunzburger:
Centroidal Voronoi Tessellations: Applications and Algorithms. SIAM Rev. 41(4): 637-676 (1999) - 1998
- [c4]Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann:
Low-Bandwidth Routing and Electrical Power Networks. ICALP 1998: 604-615 - 1996
- [j14]Vance Faber, Wayne Joubert, Emanuel Knill, Thomas A. Manteuffel:
Minimal Residual Method Stronger than Polynomial Preconditioning. SIAM J. Matrix Anal. Appl. 17(4): 707-729 (1996) - 1995
- [j13]Tony L. Brewster, Michael J. Dinneen, Vance Faber:
A computational attack on the conjectures of Graffiti: New counterexamples and proofs. Discret. Math. 147(1-3): 35-55 (1995) - [j12]Richard N. Draper, Vance Faber:
The Diameter and Average Distance of Supertoroidal Networks. J. Parallel Distributed Comput. 31(1): 1-13 (1995) - [j11]Jonathan N. Bradley, Vance Faber:
Perfect reconstruction with critically sampled filter banks and linear boundary conditions. IEEE Trans. Signal Process. 43(4): 994-997 (1995) - 1994
- [j10]Fan R. K. Chung, Vance Faber, Thomas A. Manteuffel:
An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. SIAM J. Discret. Math. 7(3): 443-457 (1994) - [c3]William Y. C. Chen, Vance Faber, Emanuel Knill:
Restricted routing and wide diameter of the cycle prefix network. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 31-46 - 1993
- [j9]Vance Faber, James W. Moore, William Y. C. Chen:
Cycle prefix digraphs for symmetric interconnection networks. Networks 23(7): 641-649 (1993) - 1992
- [j8]Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton:
Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 41(2): 218-220 (1992) - 1991
- [c2]Michael J. Dinneen, Michael R. Fellows, Vance Faber:
Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158
1980 – 1989
- 1988
- [j7]Olaf M. Lubeck, Vance Faber:
Modeling the performance of hypercubes: a case study using the particle-in-cell application. Parallel Comput. 9(1): 37-52 (1988) - 1987
- [j6]Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.:
Comments on the paper "parallel efficiency can be greater than unity" . Parallel Comput. 4(2): 209-210 (1987) - [c1]Vance Faber:
Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk. PP 1987: 412 - 1986
- [j5]Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.:
Superlinear speedup of an efficient sequential algorithm is not possible. Parallel Comput. 3(3): 259-260 (1986) - 1984
- [j4]Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead:
A new method of proving theorems on chromatic index. Discret. Math. 52(2-3): 159-164 (1984) - 1980
- [j3]Donald L. Goldsmith, Bennet Manvel, Vance Faber:
Separation of graphs into three components by the removal of edges. J. Graph Theory 4(2): 213-218 (1980)
1970 – 1979
- 1976
- [j2]Jean-Claude Bermond, Vance Faber:
Decomposition of the complete directed graph into k-circuits. J. Comb. Theory B 21(2): 146-155 (1976) - 1973
- [j1]Vance Faber, Jan Mycielski:
Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth. Discret. Math. 4(4): 339-345 (1973)
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-01-09 12:55 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:
