io-port.net

io-port 05216732 Abello, J.; Pogel, A.J.; Miller, L.

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

1

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 05216703 Cordón-Franco, A.; Sancho-Caparrini, F.

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

2

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 05216676 Chaudhuri, P.; Thompson, H.

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

3

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02041916 Spinrad, Jeremy P.

A note on computing graph closures. (English)

Discrete Math. 276, No.1-3, 327-329 (2004).

Classification: F.2.2 G.2.2

4

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02041910 Guenver, Glen-Brug; Rampon, Jean-Xavier

Split orders. (English)

Discrete Math. 276, No.1-3, 249-267 (2004).

Classification: F.2.2 G.2.2

5

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02041897 Caporossi, Gilles; Hansen, Pierre

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

6

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02041894 Bonichon, Nicolas; Le Saëc, Bertrand; Mosbah, Mohamed

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

7

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02037563 Hicks, Illya V.

Branch decompositions and minor containment. (English)

Networks 43, No.1, 1-9 (2004).

Classification: F.2.2 G.2.2

8

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02037545 Kelmans, Alexander; Mubayi, Dhruv

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

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02035870 Guo, Xiaofeng; Zhang, Fuji

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

10

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02035869 Gionfriddo, Lucia

Voloshin’s colourings of $P_{3}$-designs. (English)

Discrete Math. 275, No.1-3, 137-149 (2004).

Classification: G.2.2 Reviewer: Benjamin Doerr (Kiel)

11

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02032859 Klostermeyer, William F.; MacGillivray, Gary

Homomorphisms and oriented colorings of equivalence classes of oriented graphs. (English)

Discrete Math. 274, No.1-3, 161-172 (2004).

Classification: G.2.2

12

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02032812 Fomin, Fedor V.; Kratsch, Dieter; Müller, Haiko

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

13

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02029940 Liotta, Giuseppe (ed.)

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. EUR 66.00/net; \$ 87.00; \sterling 51.00; sFr 117.00 (2004).

Classification: A.m G.2.2 I.3 F.2.2

14

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02029936 Chae, Kijoon (ed.); Yung, Moti (ed.)

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. EUR 62.00/net; \$ 81.00; \sterling 47.50; sFr 109.50 (2004).

Classification: A.m E.4 G.2.2 C.2.1 C.2.6 E.3

15

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 05481767 Graefe, Goetz

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

16

PDF XML AMS-TeX TEXT BIBTeX FullText

io-port 05481013 Weiskircher, René

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

17

PDF XML AMS-TeX TEXT BIBTeX FullText

io-port 02044622 Obaidat, Mohammad S. (ed.); Papadimitriou, Georgios I. (ed.)

Applied system simulation. Methodologies and applications. (English)

Boston, MA: Kluwer Academic Publishers. vi, 515 p. EUR 152.00; \$ 168.00; \sterling 104.00 (2003).

Classification: J.1 I.2.8 G.2.2 E.4 G.3 J.7 C.3 I.6 Reviewer: A.Akutowicz (Berlin)

18

PDF XML AMS-TeX TEXT BIBTeX

io-port 02038399 Feigenbaum, Joan (ed.)

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. EUR 38.00/net; \$ 47.00; \sterling 29.00; sFr 61.00 (2003).

Classification: A.m E.4 G.2.2 E.3

19

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02037561 Cheng, Xiuzhen; Huang, Xiao; Li, Deying; Wu, Weili; Du, Ding-Zhu

A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. (English)

Networks 42, No.4, 202-208 (2003).

Classification: F.2.2 G.2.2

20

PDF XML AMS-TeX TEXT BIBTeX DOI