Vance Faber - RankMe

42 papers A* 1A 1Journal 36Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Which cubic graphs have quadrangulated spherical immersions? Ars Math. Contemp. Lowell Abrams, Yosef Berman, Vance Faber, Michael Murphy
2025	J	`jnl`	Matrix best approximation in the spectral norm. CoRR Vance Faber, Jörg Liesen, Petr Tichý
2024	J	`jnl`	Network routing on regular digraphs and their line graphs. J. Sched. Vance Faber, Noah Streib
2022	J	`jnl`	Digraph Networks and Groupoids. CoRR Nyumbu Chishwashwa, Vance Faber, Noah Streib
2022	J	`jnl`	On the Forsythe conjecture. CoRR Vance Faber, Jörg Liesen, Petr Tichý
2020	J	`jnl`	Bounds and algorithms for graph trusses. J. Graph Algorithms Appl. Paul Burkhardt, Vance Faber, David G. Harris
2019	J	`jnl`	Edge-coloring linear hypergraphs with medium-sized edges. Random Struct. Algorithms Vance Faber, David G. Harris
2018	J	`jnl`	Bounds and algorithms for k-truss. CoRR Paul Burkhardt, Vance Faber, David G. Harris
2014	J	`jnl`	Transpose on vertex symmetric digraphs. CoRR Vance Faber
2013	J	`jnl`	Global communication algorithms for Cayley graphs CoRR Vance Faber
2013	J	`jnl`	Properties of Worst-Case GMRES. SIAM J. Matrix Anal. Appl. Vance Faber, Jörg Liesen, Petr Tichý
2012	J	`jnl`	Global sum on symmetric networks CoRR Vance Faber
2012	J	`jnl`	Livelock free routing schemes CoRR Vance Faber
2011	J	`jnl`	Multi-scale correlation structure of gene expression in the brain. Neural Networks Michael Hawrylycz, Lydia Ng, Damon Page, John Morris, Christopher Lau, Sky Faber, Vance Faber, Susan Sunkin, Vilas Menon, Ed S. Lein, Allan Jones
2011	J	`jnl`	Review of chromatic graph theory by Gary Chartrand and Ping Zhang. SIGACT News Vance Faber
2010	J	`jnl`	On Chebyshev Polynomials of Matrices. SIAM J. Matrix Anal. Appl. Vance Faber, Jörg Liesen, Petr Tichý
2009	J	`jnl`	On orthogonal reduction to Hessenberg form with small bandwidth. Numer. Algorithms Vance Faber, Jörg Liesen, Petr Tichý
2008	J	`jnl`	The Faber-Manteuffel Theorem for Linear Operators. SIAM J. Numer. Anal. Vance Faber, Jörg Liesen, Petr Tichý
2004	J	`jnl`	The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. SIAM J. Discret. Math. Randall Dougherty, Vance Faber
2004	J	`jnl`	Unflippable Tetrahedral Complexes. Discret. Comput. Geom. Randall Dougherty, Vance Faber, Michael Murphy
2003	J	`jnl`	Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry. J. Graph Algorithms Appl. Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Doug Cook, Gregory Hicks, Vance Faber, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
2001	—	`conf`	Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. WAE Christopher L. Barrett, Doug Cook, Gregory Hicks, Vance Faber, Achla Marathe, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann, Heidi Thornquist
2001	A	`conf`	High-Quality Polygonal Contour Approximation Based on Relaxation. ICDAR Artem Mikheev, Luc Vincent, Vance Faber
1999	J	`jnl`	Centroidal Voronoi Tessellations: Applications and Algorithms. SIAM Rev. Qiang Du, Vance Faber, Max D. Gunzburger
1998	A*	`conf`	Low-Bandwidth Routing and Electrical Power Networks. ICALP Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann
1996	J	`jnl`	Minimal Residual Method Stronger than Polynomial Preconditioning. SIAM J. Matrix Anal. Appl. Vance Faber, Wayne Joubert, Emanuel Knill, Thomas A. Manteuffel
1995	J	`jnl`	A computational attack on the conjectures of Graffiti: New counterexamples and proofs. Discret. Math. Tony L. Brewster, Michael J. Dinneen, Vance Faber
1995	J	`jnl`	Perfect reconstruction with critically sampled filter banks and linear boundary conditions. IEEE Trans. Signal Process. Jonathan N. Bradley, Vance Faber
1995	J	`jnl`	The Diameter and Average Distance of Supertoroidal Networks. J. Parallel Distributed Comput. Richard N. Draper, Vance Faber
1994	J	`jnl`	An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian. SIAM J. Discret. Math. Fan R. K. Chung, Vance Faber, Thomas A. Manteuffel
1994	—	`conf`	Restricted routing and wide diameter of the cycle prefix network. Interconnection Networks and Mapping and Scheduling Parallel Computations William Y. C. Chen, Vance Faber, Emanuel Knill
1993	J	`jnl`	Cycle prefix digraphs for symmetric interconnection networks. Networks Vance Faber, James W. Moore, William Y. C. Chen
1992	J	`jnl`	Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 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
1991	—	`conf`	Algebraic Constructions of Efficient Broadcast Networks. AAECC Michael J. Dinneen, Michael R. Fellows, Vance Faber
1988	J	`jnl`	Modeling the performance of hypercubes: a case study using the particle-in-cell application. Parallel Comput. Olaf M. Lubeck, Vance Faber
1987	J	`jnl`	Comments on the paper "parallel efficiency can be greater than unity" . Parallel Comput. Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.
1987	—	`conf`	Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk. PP Vance Faber
1986	J	`jnl`	Superlinear speedup of an efficient sequential algorithm is not possible. Parallel Comput. Vance Faber, Olaf M. Lubeck, Andrew B. White Jr.
1984	J	`jnl`	A new method of proving theorems on chromatic index. Discret. Math. Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead
1980	J	`jnl`	Separation of graphs into three components by the removal of edges. J. Graph Theory Donald L. Goldsmith, Bennet Manvel, Vance Faber
1976	J	`jnl`	Decomposition of the complete directed graph into k-circuits. J. Comb. Theory B Jean-Claude Bermond, Vance Faber
1973	J	`jnl`	Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth. Discret. Math. Vance Faber, Jan Mycielski