@article{Wang/97a,
AUTHOR = {Wang, Yongge},
TITLE = {$NP$-hard sets are superterse unless $NP$ is small},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {1-6},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Farach-Muthukrishnan/97,
AUTHOR = {Farach, Martin and Muthukrishnan, S.},
TITLE = {Optimal parallel randomized renaming},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {7-10},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{King-Tzeng/97,
AUTHOR = {King, Gow-Hsing and Tzeng, Wen-Guey},
TITLE = {On-line algorithms for the dominating set problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {11-14},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kornerup/97,
AUTHOR = {Kornerup, Jacob},
TITLE = {Odd-even sort in powerlists},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {15-24},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hasunuma-Shibata/97a,
AUTHOR = {Hasunuma, Toru and Shibata, Yukio},
TITLE = {Containment of butterflies in networks constructed by the line digraph operation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {25-30},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sedjelmaci-Lavault/97,
AUTHOR = {Sedjelmaci, Mohamed S. and Lavault, Christian},
TITLE = {Improvements on the accelerated integer GCD algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {31-36},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bozanis-Kitsios-Makris-Tsakalidis/97,
AUTHOR = {Bozanis, Panayiotis and Kitsios, Nectarios and Makris, Christos and Tsakalidis, Athanasios},
TITLE = {The space-optimal version of a known rectangle enclosure reporting algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {37-41},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ashir-Stewart-Ahmed/97,
AUTHOR = {Ashir, Yaagoub and Stewart, Iain A. and Ahmed, Aqeel},
TITLE = {Communication algorithms in $k$-ary $n$-cube interconnection networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {43-48},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Blum-Karger/97,
AUTHOR = {Blum, Avrim and Karger, David},
TITLE = {An $\tilde{O}(n^{3/14})$-coloring algorithm for 3-colorable graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {49-53},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Taylor-Hachem-Selkow/97,
AUTHOR = {Taylor, Stephen and Hachem, Nabil and Selkow, Stanley},
TITLE = {The average height of a node in the BANG abstract directory tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {1},
PAGES = {55-61},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Zippel/97,
AUTHOR = {Zippel, Richard},
TITLE = {Zero testing of algebraic functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {63-67},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Loescher/97,
AUTHOR = {Loescher, Bernd},
TITLE = {One unary function says less than two in existential second order logic},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {69-75},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Guan-Zhu/97,
AUTHOR = {Guan, D.J. and Zhu, Xuding},
TITLE = {A coloring problem for weighted graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {77-81},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Uehara/97,
AUTHOR = {Uehara, Ryuhei},
TITLE = {Collapse of $PP$ with a semi-random source to $BPP$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {83-87},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Saab/97,
AUTHOR = {Saab, Youssef G.},
TITLE = {An improved algorithm for intersecting convex polygons},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {89-90},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Shikishima-Tsuji-Katsura-Kobayashi/97,
AUTHOR = {Shikishima-Tsuji, Kayoko and Katsura, Masashi and Kobayashi, Yuji},
TITLE = {On termination of confluent one-rule string-rewriting systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {91-96},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chung/97,
AUTHOR = {Chung, Kuo-Liang},
TITLE = {Efficient Huffman decoding},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {97-99},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bodlaender-Thilikos-Yamazaki/97,
AUTHOR = {Bodlaender, Hans L. and Thilikos, Dimitrios M. and Yamazaki, Koichi},
TITLE = {It is hard to know when greedy is good for finding independent sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {101-106},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lu-Tang/97,
AUTHOR = {Lu, Chin Lung and Tang, Chuan Yi},
TITLE = {A linear-time algorithm for the weighted feedback vertex problem on interval graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {107-111},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Franciosa-Gambosi-Nanni/97,
AUTHOR = {Franciosa, Paolo G. and Gambosi, Giorgio and Nanni, Umberto},
TITLE = {The incremental maintenance of a depth-first-search tree in directed acyclic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {2},
PAGES = {113-120},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Deogun-Kratsch-Steiner/97,
AUTHOR = {Deogun, Jitender S. and Kratsch, Dieter and Steiner, George},
TITLE = {An approximation algorithm for clustering graphs with dominating diametral path},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {121-127},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Lecroq-Luce-Myoupo/97,
AUTHOR = {Lecroq, Thierry and Luce, Guillaume and Myoupo, Jean Fr{\'{e}}d{\'{e}}ric},
TITLE = {A faster linear systolic algorithm for recovering a longest common subsequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {129-136},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Mosca/97,
AUTHOR = {Mosca, Raffaele},
TITLE = {Polynomial algorithms for the maximum stable set problem on particular classes of $P_5$-free graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {137-143},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Zhang/97a,
AUTHOR = {Zhang, Guochuan},
TITLE = {A simple semi on-line algorithm for $P2//C_max$ with a buffer},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {145-148},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Hong-Kim/97,
AUTHOR = {Hong, Seok Hee and Kim, Myoung Ho},
TITLE = {Resolving data conflicts with multiple versions and precedence relationships in real-time databases},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {149-156},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Fris-Havel-Liebl/97,
AUTHOR = {Fri{\v{s}}, Ivan and Havel, Ivan and Liebl, Petr},
TITLE = {The diameter of the cube-connected cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {157-160},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Rosenbloom/97,
AUTHOR = {Rosenbloom, Arnold},
TITLE = {Monotone real circuits are more powerful than monotone Boolean circuits},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {161-164},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wang/97b,
AUTHOR = {Wang, M.Z.},
TITLE = {Linear complexity profiles and jump complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {165-168},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Sato/97,
AUTHOR = {Sato, Tadakazu},
TITLE = {Ergodicity of linear cellular automata over $Z_m$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {3},
PAGES = {169-172},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Wang-Hsu-Sung/97,
AUTHOR = {Wang, Shih-Yih and Hsu, Lih-Hsing and Sung, Ting-Yi},
TITLE = {Faithful 1-edge fault tolerant graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {173-181},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Henk/97,
AUTHOR = {Henk, Martin},
TITLE = {Note on shortest and nearest lattice vectors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {183-188},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Cintioli-Silvestri/97,
AUTHOR = {Cintioli, Patrizio and Silvestri, Riccardo},
TITLE = {Revisiting a result of Ko},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {189-194},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{DellOllmo-Giordani-Speranza/97,
AUTHOR = {Dell'Ollmo, P. and Giordani, S. and Speranza, M.G.},
TITLE = {An approximation result for a duo-processor task scheduling problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {195-200},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Encarnacion/97,
AUTHOR = {Encarnaci{\'{o}}n, Mark J.},
TITLE = {Black-box polynomial resultants},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {201-204},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Roupin/97,
AUTHOR = {Roupin, Fr{\'{e}}d{\'{e}}ric},
TITLE = {On approximating the memory-constrained module allocation problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {205-208},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Park-Lee-Sung-Kim/97,
AUTHOR = {Park, Sung Mo and Lee, Sangjin and Sung, Soo Hak and Kim, Kwangjo},
TITLE = {Improving bounds for the number of correlation immune Boolean functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {209-212},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Choi-Lam/97,
AUTHOR = {Choi, Y. and Lam, T.W.},
TITLE = {Dynamic suffix tree and two-dimensional texts management},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {213-220},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kulasinghe/97,
AUTHOR = {Kulasinghe, Priyalal D.},
TITLE = {Connectivity of the crossed cube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {4},
PAGES = {221-226},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Thilikos-Bodlaender/97,
AUTHOR = {Thilikos, Dimitrios M. and Bodlaender, Hans L.},
TITLE = {Fast partitioning $l$-apex graphs with applications to approximating maximum induced-subgraph problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {227-232},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Mazurkiewicz/97,
AUTHOR = {Mazurkiewicz, Antoni},
TITLE = {Distributed enumeration},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {233-239},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Morris/97,
AUTHOR = {Morris, Joseph M.},
TITLE = {Non-deterministic expressions and predicate transformers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {241-246},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Calamoneri-Petreschi/97,
AUTHOR = {Calamoneri, Tiziana and Petreschi, Rossella},
TITLE = {A new 3D representation of trivalent Cayley networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {247-252},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Myoupo-Wabbi/97,
AUTHOR = {Myoupo, Jean-Fr{\'{e}}d{\'{e}}ric and Wabbi, Ahmad},
TITLE = {Improved linear systolic algorithms for substring statistics},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {253-258},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Micheneau/97,
AUTHOR = {Micheneau, C.},
TITLE = {Disjoint Hamiltonian cycles in recursive circulant graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {259-264},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Iwama-Iwamoto-Ohsawa/97,
AUTHOR = {Iwama, K. and Iwamoto, C. and Ohsawa, T.},
TITLE = {A faster parallel algorithm for $k$-connectivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {265-269},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Verbarg/97,
AUTHOR = {Verbarg, Knut},
TITLE = {Approximate center points in dense point sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {271-278},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Schoenmakers/97,
AUTHOR = {Schoenmakers, Berry},
TITLE = {A tight lower bound for top-down skew heaps},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {5},
PAGES = {279-284},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kumar-Silberschatz/97,
AUTHOR = {Kumar, Devendra and Silberschatz, Abraham},
TITLE = {A counter-example to an algorithm for the generalized input-output construct of $CSP$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {287-287},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Kushilevitz/97,
AUTHOR = {Kushilevitz, Eyal},
TITLE = {A simple algorithm for learning $O\log n)$-term DNF},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {289-292},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Ibarra/97,
AUTHOR = {Ibarra, Louis},
TITLE = {Finding pattern matchings for permutations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {293-295},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Dror-Kubiak-DellOlmo/97,
AUTHOR = {Dror, Moshe and Kubiak, Wieslaw and Dell'Olmo, Paolo},
TITLE = {Scheduling chains to minimize mean flow time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {297-301},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Bshouty/97,
AUTHOR = {Bshouty, Nader H.},
TITLE = {On learning multivariate polynomials under the uniform distribution},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {303-309},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chao-Hsu-Lee/97,
AUTHOR = {Chao, H.S. and Hsu, F.R. and Lee, R.C.T.},
TITLE = {An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {311-316},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Chen-Kanchi-Kanevsky/97,
AUTHOR = {Chen, Jianer and Kanchi, Saroja P. and Kanevsky, Arkady},
TITLE = {A note on approximating graph genus},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {317-322},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Vakali-Manolopuolos/97,
AUTHOR = {Vakali, Athena and Manolopuolos, Yannis},
TITLE = {An exact analysis on expected seeks in shadowed disks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {323-329},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}
@article{Flocchini/97,
AUTHOR = {Flocchini, Paola},
TITLE = {Minimal sense of direction in regular networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {61},
NUMBER = {6},
PAGES = {331-338},
YEAR = {1997},
PUBLISHER = {North-Holland Publishing Company},
ADDRESS = {Amsterdam-New York-Oxford-Tokyo},
}