- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j42 |      | |
| j41 | | Carla D. Savage, Michael J. Schuster: Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences. J. Comb. Theory, Ser. A 119(4): 850-870 (2012) |
| 2009 | ||
| j40 | | Ian Shields, Brendan J. Shields, Carla D. Savage: An update on the middle levels problem. Discrete Mathematics 309(17): 5271-5277 (2009) |
| j39 | | Zongliang Jiang, Carla D. Savage: On the existence of symmetric chain decompositions in a quotient of the Boolean lattice. Discrete Mathematics 309(17): 5278-5283 (2009) |
| 2008 | ||
| j38 | | Carla D. Savage, Ae Ja Yee: Euler's partition theorem and the combinatorics of l-sequences. J. Comb. Theory, Ser. A 115(6): 967-996 (2008) |
| 2006 | ||
| c1 | | Rudra Dutta, Prashant Iyer, Carla D. Savage: Complexity of Converter Placement Supporting Broadcast in WDM Networks. BROADNETS 2006 |
| 2005 | ||
| j37 | | |
| 2004 | ||
| j36 | | Jerrold R. Griggs, Charles E. Killian, Carla D. Savage: Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice. Electr. J. Comb. 11(1) (2004) |
| j35 | | Charles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston: Half-Simple Symmetric Venn Diagrams. Electr. J. Comb. 11(1) (2004) |
| j34 | | Charles E. Killian, Carla D. Savage: Antipodal Gray codes. Discrete Mathematics 281(1-3): 221-236 (2004) |
| j33 | | Sylvie Corteel, Carla D. Savage: Lecture hall theorems, q-series and truncated objects. J. Comb. Theory, Ser. A 108(2): 217-245 (2004) |
| j32 | | Pawel Hitczenko, Carla D. Savage: On the Multiplicity of Parts in a Random Composition of a Large Integer. SIAM J. Discrete Math. 18(2): 418-435 (2004) |
| 2003 | ||
| j31 | | Carla D. Savage, Ian Shields, Douglas B. West: On the existence of Hamiltonian paths in the cover graph of M(n). Discrete Mathematics 262(1-3): 241-252 (2003) |
| j30 | | Sylvie Corteel, Carla D. Savage: Anti-Lecture Hall Compositions. Discrete Mathematics 263(1-3): 275-280 (2003) |
| 2002 | ||
| j29 |  | Deborah A. Frank, Carla D. Savage, James A. Sellers: On the Number of Graphical Forest Partitions. Ars Comb. 65 (2002) |
| j28 | | Alexander Burstein, Sylvie Corteel, Alexander Postnikov, Carla D. Savage: A lattice path approach to counting partitions with minimum rank t. Discrete Mathematics 249(1-3): 31-39 (2002) |
| 1999 | ||
| j27 | | Sylvie Corteel, Boris Pittel, Carla D. Savage, Herbert S. Wilf: On the multiplicity of parts in a random partition. Random Struct. Algorithms 14(2): 185-197 (1999) |
| 1998 | ||
| j26 | | |
| j25 | | Jennifer M. Nolan, Carla D. Savage, Herbert S. Wilf: Basis partitions. Discrete Mathematics 179(1-3): 277-283 (1998) |
| j24 | | Carla D. Savage, Cun-Quan Zhang: The connectivity of acyclic orientation graphs. Discrete Mathematics 184(1-3): 281-287 (1998) |
| j23 | | Jennifer M. Nolan, Vijay Sivaraman, Carla D. Savage, Pranav K. Tiwari: Graphical Basis Partitions. Graphs and Combinatorics 14(3): 241-261 (1998) |
| j22 | | Sylvie Corteel, Carla D. Savage, Herbert S. Wilf, Doron Zeilberger: A Pentagonal Number Sieve. J. Comb. Theory, Ser. A 82(2): 186-192 (1998) |
| j21 | | Sylvie Corteel, Carla D. Savage, Radhika Venkatraman: A Bijection for Partitions with All Ranks at Least t. J. Comb. Theory, Ser. A 83(2): 202-220 (1998) |
| 1997 | ||
| j20 | | Tiffany M. Barnes, Carla D. Savage: Efficient Generation of Graphical Partitions. Discrete Applied Mathematics 78(1-3): 17-26 (1997) |
| 1996 | ||
| j19 | | |
| j18 | | Frank Ruskey, Carla D. Savage: A Gray Code for Combinations of a Multiset. Eur. J. Comb. 17(5): 493-500 (1996) |
| j17 | | Terry Min Yih Wang, Carla D. Savage: A Gray Code for Necklaces of Fixed Density. SIAM J. Discrete Math. 9(4): 654-673 (1996) |
| 1995 | ||
| j16 | | Tiffany M. Barnes, Carla D. Savage: A Recurrence for Counting Graphical Partitions. Electr. J. Comb. 2 (1995) |
| j15 | | David J. Rasmussen, Carla D. Savage: Gray Code Enumeration of Families of Integer Partitions. J. Comb. Theory, Ser. A 70(2): 201-229 (1995) |
| j14 | | Carla D. Savage, Peter Winkler: Monotone Gray Codes and the Middle Levels Problem. J. Comb. Theory, Ser. A 70(2): 230-248 (1995) |
| 1994 | ||
| j13 | | David J. Rasmussen, Carla D. Savage: Hamilto-connected derangement graphs on S n. Discrete Mathematics 133(1-3): 217-223 (1994) |
| 1993 | ||
| j12 | | Frank Ruskey, Carla D. Savage: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn. SIAM J. Discrete Math. 6(1): 152-166 (1993) |
| 1992 | ||
| j11 | | Frank Ruskey, Carla D. Savage, Terry Min Yih Wang: Generating Necklaces. J. Algorithms 13(3): 414-430 (1992) |
| 1990 | ||
| j10 | | Carla D. Savage, Matthias F. M. Stallmann, Jo Ellen Perry: Solving Some Combinatorial Problems on Arrays with One-Way Dataflow. Algorithmica 5(2): 179-199 (1990) |
| j9 | | Carla D. Savage: Generating Permutations with k-Differences. SIAM J. Discrete Math. 3(4): 561-573 (1990) |
| 1989 | ||
| j8 | | |
| 1988 | ||
| j7 | | |
| 1985 | ||
| j6 | | Sunil Ashtaputre, Carla D. Savage: Systolic Arrays with Embedded Tree Structures for Connectivity Problems. IEEE Trans. Computers 34(5): 483-484 (1985) |
| 1984 | ||
| j5 | | Carla D. Savage: A Systolic Design for Connectivity Problems. IEEE Trans. Computers 33(1): 99-104 (1984) |
| 1982 | ||
| j4 | | Carla D. Savage: Depth-First Search and the Vertex Cover Problem. Inf. Process. Lett. 14(5): 233-237 (1982) |
| j3 | | Wesley E. Snyder, Carla D. Savage: Content Adressable Read/Write Memories for Image Analysis. IEEE Trans. Computers 31(10): 963-968 (1982) |
| 1981 | ||
| j2 | | Carla D. Savage, Joseph JáJá: Fast, Efficient Parallel Algorithms for Some Graph Problems. SIAM J. Comput. 10(4): 682-691 (1981) |
| 1980 | ||
| j1 | | |
Colors in the list of coauthors
Last update Sun May 26 00:01:02 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page