Works matching IS 01290541 AND DT 2000 AND VI 11 AND IP 3

Results: 10

All Separating Triangles in a Plane Graph can be Optimally “Broken” in Polynomial Time.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 405, doi. 10.1142/S012905410000020X
By:
- Accornero, Anna;
- Ancona, Massimo;
- Varini, Sonia;
- Olariu, Stephan
Publication type:
Article
Generating All the Minimal Separators of a Graph.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 397, doi. 10.1142/S0129054100000211
By:
- Berry, Anne;
- Bordat, Jean-Paul;
- Cogis, Olivier;
- Olariu, Stephan
Publication type:
Article
NLC[sub 2]-Decomposition in Polynomial Time.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 373, doi. 10.1142/S0129054100000223
By:
- Johansson, Öjvind;
- Olariu, Stephan
Publication type:
Article
On the Hardness of Recognizing Bundles in Time Table Graphs.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 467, doi. 10.1142/S0129054100000235
By:
- Liebers, Annegret;
- Wagner, Dorothea;
- Weihe, Karsten;
- Olariu, Stephan
Publication type:
Article
An Improved Algorithm for Finding Tree Decompositions of Small Width.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 365
By:
- Perković, Ljubomir;
- Reed, Bruce;
- Olariu, Stephan
Publication type:
Article
Finding Smallest Supertrees Under Minor Containment.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 445, doi. 10.1142/S0129054100000259
By:
- Nishimura, Naomi;
- Ragde, Prabhakar;
- Thilikos, Dimitrios M;
- Olariu, Stephan
Publication type:
Article
On the Clique-Width of Some Perfect Graph Classes.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 423, doi. 10.1142/S0129054100000260
By:
- Golumbic, Martin Charles;
- Rotics, Udi;
- Olariu, Stephan
Publication type:
Article
Mod-2 Independence and Domination in Graphs.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 355
By:
- Halldórsson, Magnús M.;
- Kratochvíl, Jan;
- Telle, Jan Arne;
- Olariu, Stephan
Publication type:
Article
Some Sufficient Conditions of Learnability in the Limit from Positive Data.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 515, doi. 10.1142/S0129054100000284
By:
- Okadome, Takesi;
- Salomma, A.
Publication type:
Article
A New Weight Balanced Binary Search Tree.
Published in:
International Journal of Foundations of Computer Science, 2000, v. 11, n. 3, p. 485, doi. 10.1142/S0129054100000296
By:
- Cho, Seonghun;
- Sahni, Sartaj;
- Olariu, Stephan
Publication type:
Article