History
1
1221
Year:
-
Type:
Journal
Book
Article
Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 from 1221 total

Minimum-cost flow algorithms: an experimental evaluation. (English)
Optim. Methods Softw. 30, No. 1, 94-127 (2015).
Classification: G.2.2 G.4
WorldCat.org
1
Breadth first search graph partitions and concept lattices. (English)
J. UCS 10, No. 8, 934-954, electronic only (2004).
Classification: G.2.2 G.2.3
WorldCat.org
2
A note on complexity measures for probabilistic p systems. (English)
J. UCS 10, No. 5, 559-566, electronic only (2004).
Classification: F.1.1 G.2.2 H.1.1
WorldCat.org
3
A message-optimal distributed graph algorithm: partial precedence constrained scheduling. (English)
J. UCS 10, No. 2, 106-119, electronic only (2004).
Classification: F.2.2 G.1.0 G.2.2
WorldCat.org
4
A note on computing graph closures. (English)
Discrete Math. 276, No.1-3, 327-329 (2004).
Classification: F.2.2 G.2.2
WorldCat.org
5
Split orders. (English)
Discrete Math. 276, No.1-3, 249-267 (2004).
Classification: F.2.2 G.2.2
WorldCat.org
6
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures. (English)
Discrete Math. 276, No.1-3, 81-94 (2004).
Classification: F.2.2 G.2.2
WorldCat.org
7
Orthogonal drawings based on the stratification of planar graphs. (English)
Discrete Math. 276, No.1-3, 43-57 (2004).
Classification: F.2.2 G.2.2
WorldCat.org
8
Branch decompositions and minor containment. (English)
Networks 43, No.1, 1-9 (2004).
Classification: F.2.2 G.2.2
WorldCat.org
9
How many disjoint 2-edge paths must a cubic graph have? (English)
J. Graph Theory 45, No.1, 57-79 (2004).
Classification: F.2.2 G.2.2
WorldCat.org
10
Reducible chains of planar 1-cycle resonant graphs. (English)
Discrete Math. 275, No.1-3, 151-164 (2004).
Classification: F.2.2 G.2.2
WorldCat.org
11
Voloshin’s colourings of $P_{3}$-designs. (English)
Discrete Math. 275, No.1-3, 137-149 (2004).
Classification: G.2.2 Benjamin Doerr (Kiel)
WorldCat.org
12
Homomorphisms and oriented colorings of equivalence classes of oriented graphs. (English)
Discrete Math. 274, No.1-3, 161-172 (2004).
Classification: G.2.2
WorldCat.org
13
Algorithms for graphs with small octopus. (English)
Discrete Appl. Math. 134, No.1-3, 105-128 (2004).
Classification: F.2.2 G.2.2 G.4
WorldCat.org
14
Graph drawing. 11th international symposium, GD 2003, Perugia, Italy, September 21‒24, 2003. Revised papers. (English)
Lecture Notes in Computer Science. 2912. Berlin: Springer. xv, 542 p. (2004).
Classification: A.m G.2.2 I.3 F.2.2
WorldCat.org
15
Information security applications. 4th international workshop, WISA 2003, Jeju Island, Korea, August 25‒27, 2003. Revised papers. (English)
Lecture Notes in Computer Science. 2908. Berlin: Springer. xii, 506 p. (2004).
Classification: A.m E.4 G.2.2 C.2.1 C.2.6 E.3
WorldCat.org
16
Partitioned b-trees - a user’s guide. (English)
Weikum, Gerhard et al., BTW 2003, Datenbanksysteme für Business, Technologie und Web, Tagungsband der 10. BTWKonferenz, 26.-28. Februar 2003, Leipzig. Bonner Köllen Verlag (ISBN 3-88579-355-5). GI-Edition - Lecture Notes in Informatics (LNI), P-26, 668-671 (2003).
Classification: G.2.2 H.2.4
WorldCat.org
17
Neue Anwendung von SPQR-Bäumen im Graphenzeichnen. (German)
Dorothea Wagner (ed.), Ausgezeichnete Informatikdissertationen 2002. Bonner Köllen Verlag (ISBN 3-88579-407-1). GI-Edition: Lecture Notes in Informatics (LNI), D-3, 201-210 (2003).
Classification: G.2.2
WorldCat.org
18
Applied system simulation. Methodologies and applications. (English)
Boston, MA: Kluwer Academic Publishers. vi, 515 p. (2003).
WorldCat.org
19
Digital rights management. ACM CCS-9 workshop, DRM 2002, Washington, DC, USA, November 18, 2002. Revised papers. (English)
Lecture Notes in Computer Science. 2696. Berlin: Springer. x, 221 p. (2003).
Classification: A.m E.4 G.2.2 E.3
WorldCat.org
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 from 1221 total

Valid XHTML 1.0 Transitional Valid CSS!