Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Zaslavsky, Thomas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
David Forge
,
Thomas Zaslavsky
Journal of Combinatorial Theory Series A
114
(1), 2007, pp. 97-109
Biased graphs - VII. Contrabalance and antivoltages
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
97
(6), 2007, pp. 1019-1040
The number of nowhere-zero flows on graphs and signed graphs
Matthias Beck
,
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
96
(6), 2006, pp. 901-918
A simple algorithm that proves half-integrality of bidirected network programming
Ethan D. Bolker
,
Thomas Zaslavsky
Networks
48
(1), 2006, pp. 36-38
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups
Konstantin Rybnikov
,
Thomas Zaslavsky
Journal of Graph Theory
51
(1), 2006, pp. 1-21
A Meshalkin theorem for projective geometries
Matthias Beck
,
Thomas Zaslavsky
Journal of Combinatorial Theory Series A
102
(2), 2003, pp. 433-441
Biased graphs - IV: Geometrical realizations
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
89
(2), 2003, pp. 231-297
A shorter, simpler, stronger proof of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains
Matthias Beck
,
Thomas Zaslavsky
Journal of Combinatorial Theory Series A
100
(1), 2002, pp. 196-199
The largest parity demigenus of a simple graph
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
70
(2), 1997, pp. 325-345
The order upper bound on parity embedding of a graph
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
68
(1), 1996, pp. 149-160
The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 136-145
Biased graphs. III. Chromatic and dichromatic invariants
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
64
(1), 1995, pp. 17-88
A coding approach to signed graphs
Patrick Solé
,
Thomas Zaslavsky
SIAM Journal on Discrete Mathematics
7
(4), 1994, November, pp. 544-553
The covering radius of the cycle code of a graph
Patrick Solé
,
Thomas Zaslavsky
Discrete Applied Mathematics
45
(1), 1993, pp. 63-70
The projective-planar signed graphs
Thomas Zaslavsky
Discrete Mathematics
113
(1-3), 1993, pp. 223-247
Orientation embedding of signed graphs
Thomas Zaslavsky
Journal of Graph Theory
16
(5), 1992, pp. 399-422
Biased graphs. II. The three matroids
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
51
, 1991, pp. 46-72
Biased graphs whose matroids are special binary matroids
Thomas Zaslavsky
Graphs and Combinatorics
6
, 1990, pp. 77-93
Biased graphs. I. Bias, balance, and gains
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
47
, 1989, pp. 32-52
Balanced decompositions of a signed graph
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
43
(1), 1987, August, pp. 1-13
The biased graphs whose matroids are binary
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 337-347
Signed graphs
Thomas Zaslavsky
Discrete Applied Mathematics
4
, 1982, pp. 47-74
Characterizations of signed graphs
Thomas Zaslavsky
Journal of Graph Theory
5
(4), 1981, pp. 401-406
Maximal dissections of a simplex
Thomas Zaslavsky
Journal of Combinatorial Theory Series A
20
, 1976, pp. 244-257