- Klaus Metsch:
On the Number of Lines in Planar Spaces. Comb. 15(1): 105-110 (1995) - Bojan Mohar:
Uniqueness and Minimality of Large Face-Width Embeddings of Graphs. Comb. 15(4): 541-556 (1995) - Moshe Morgenstern:
Natural Bounded Concentrators. Comb. 15(1): 111-122 (1995) - Noam Nisan, Avi Wigderson:
On Rank vs. Communication Complexity. Comb. 15(4): 557-565 (1995) - Alessandro Panconesi, Aravind Srinivasan:
The Local Natur of Delta-Coloring and its Algorithmic Applications. Comb. 15(2): 255-280 (1995) - Serge A. Plotkin, Éva Tardos:
Improved Bounds on the Max-Flow Min-Cut Ratio for Multicommodity Flows. Comb. 15(3): 425-434 (1995) - Ran Raz, Boris Spieker:
On the "Log Rank"-Conjecture in Communication Complexity. Comb. 15(4): 567-588 (1995) - Vojtech Rödl, Norbert Sauer, Xuding Zhu:
Ramsey Families which Exclude a Graph. Comb. 15(4): 589-596 (1995) - David Rubinstein:
Sensitivity vs. Block Sensitivity of Boolean Functions. Comb. 15(2): 297-299 (1995) - Paul D. Seymour:
Packing Directed Circuits Fractionally. Comb. 15(2): 281-288 (1995) - Gábor Tardos:
Transversals of 2-Intervals, a Topological Approach. Comb. 15(1): 123-134 (1995) - Dorothea Wagner, Karsten Weihe:
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. Comb. 15(1): 135-150 (1995) - David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani:
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. Comb. 15(3): 435-454 (1995) - D. A. Youngs:
Minimal Orientations of Colour Critical Graphs. Comb. 15(2): 289-295 (1995) - H. L. Abbott, Bing Zhou:
Some Remarks on (k-1)-Critical Subgraphs of k-Critical Graphs. Comb. 15(4): 469-474 (1995)