@article{Rim-Jang-Kim/03,
AUTHOR = {Rim, Hwakyung and Jang, Ju-wook and Kim, Sungchun},
TITLE = {A simple reduction of non-uniformity in dynamic load balancing of quantized loads on hypercube multiprocessors and hiding balancing overheads},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {1-25},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Dynamic load balancing, Hypercube multiprocessors, Communication overheads, Quantized loads, Parallel processing environment, Uniform distribution},
URL = {DOI:10.1016/S0022-0000(03)00033-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Dolev-Rajsbaum/03,
AUTHOR = {Dolev, Shlomi and Rajsbaum, Sergio},
TITLE = {Stability of long-lived consensus},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {26-45},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00063-1},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Damaschke/03,
AUTHOR = {Damaschke, Peter},
TITLE = {On parallel attribute-efficient learning},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {46-62},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Learning by queries, Monotone Boolean functions, Relevant variables, Limits of parallelization, Binary codes, Randomization, Auxiliary computation, Special assignment families},
URL = {DOI:10.1016/S0022-0000(03)00047-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gasarch-Golub-Kruskal/03,
AUTHOR = {Gasarch, William and Golub, Evan and Kruskal, Clyde},
TITLE = {Constant time parallel sorting: An empirical view},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {63-91},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00040-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cohen-Kaplan-Zwick/03,
AUTHOR = {Cohen, Edith and Kaplan, Haim and Zwick, Uri},
TITLE = {Connection caching: Model and algorithms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {92-126},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Cache replacement, Online algorithms, Competitive analysis, Marking algorithms, Connection caching},
URL = {DOI:10.1016/S0022-0000(03)00041-2},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Meinke/03,
AUTHOR = {Meinke, K.},
TITLE = {Proof theory of higher-order equations: Conservativity, normal forms and term rewriting},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {127-173},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00048-5},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Allouche-Skordev/03,
AUTHOR = {Allouche, J.-P. and Skordev, G.},
TITLE = {Remarks on permutive cellular automata},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {174-182},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Cellular automata, Permutivity, Permutativity, One-sided shift, Chaotic cellular automata},
URL = {DOI:10.1016/S0022-0000(03)00049-7},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chrobak-Epstein-Noga-Sgall-van_Stee-Tichy-Vakhania/03,
AUTHOR = {Chrobak, Marek and Epstein, Leah and Noga, John and Sgall, Ji{\v{r}}{\'{\i}} and van Stee, Rob and Tich{\'y}, Tom{\'a}{\v{s}} and Vakhania, Nodari},
TITLE = {Preemptive scheduling in overloaded systems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {183-197},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Scheduling, Online algorithms, Deadline, Resource augmentation},
URL = {DOI:10.1016/S0022-0000(03)00070-9},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ranade/03,
AUTHOR = {Ranade, Abhiram G.},
TITLE = {Scheduling loosely connected task graphs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {1},
PAGES = {198-208},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Precedence-constrained scheduling, Approximation algorithm},
URL = {DOI:10.1016/S0022-0000(03)00071-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Alon-Fernandez_de_la_Vega-Kannan-Karpinski/03,
AUTHOR = {Alon, Noga and Fernandez de la Vega, W. and Kannan, Ravi and Karpinski, Marek},
TITLE = {Random sampling and approximation of MAX-CSPs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {212-243},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00008-4},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Basu/03,
AUTHOR = {Basu, Saugata},
TITLE = {Computing the Betti numbers of arrangements via spectral sequences},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {244-262},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Semi-algebraic sets, Betti numbers, Spectral sequence},
URL = {DOI:10.1016/S0022-0000(03)00009-6},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chien-Rasmussen-Sinclair/03,
AUTHOR = {Chien, Steve and Rasmussen, Lars and Sinclair, Alistair},
TITLE = {Clifford algebras and approximating the permanent},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {263-290},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00010-2},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cryan-Dyer/03,
AUTHOR = {Cryan, Mary and Dyer, Martin},
TITLE = {A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {291-310},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Contingency tables, Approximate counting, Randomized algorithms},
URL = {DOI:10.1016/S0022-0000(03)00014-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Deng-Papadimitriou-Safra/03,
AUTHOR = {Deng, Xiaotie and Papadimitriou, Christos and Safra, Shmuel},
TITLE = {On the complexity of price equilibria},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {311-324},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00011-4},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Arora-Khot/03,
AUTHOR = {Arora, Sanjeev and Khot, Subhash},
TITLE = {Fitting algebraic curves to noisy data},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {325-340},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Curve Fitting, Noisy polynomial reconstruction, List decoding, Learning theory, Vision},
URL = {DOI:10.1016/S0022-0000(03)00012-6},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Roughgarden/03,
AUTHOR = {Roughgarden, Tim},
TITLE = {The price of anarchy is independent of the network topology},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {341-364},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00044-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Schaefer-Sedgwick-Stefankovic/03,
AUTHOR = {Schaefer, Marcus and Sedgwick, Eric and {\v{S}}tefankovi{\v{c}}, Daniel},
TITLE = {Recognizing string graphs in $NP$},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {365-380},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {String graphs, $NP$-completeness, Graph drawing, Topological inference, Euler diagrams},
URL = {DOI:10.1016/S0022-0000(03)00045-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Brodal-Lagogiannis-Makris-Tsakalidis-Tsichlas/03,
AUTHOR = {Brodal, Gerth St{\o}lting and Lagogiannis, George and Makris, Christos and Tsakalidis, Athanasios and Tsichlas, Kostas},
TITLE = {Optimal finger search trees in the pointer machine},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {381-418},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Balanced search trees, Data structures, Complexity},
URL = {DOI:10.1016/S0022-0000(03)00013-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Umans/03,
AUTHOR = {Umans, Christopher},
TITLE = {Pseudo-random generators for all hardnesses},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {419-440},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Pseudo-random number generators, Derandomization, Complexity classes, Low-degree extension},
URL = {DOI:10.1016/S0022-0000(03)00046-1},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Achlioptas-Moore/03,
AUTHOR = {Achlioptas, Dimitris and Moore, Cristopher},
TITLE = {Almost all graphs with average degree 4 are 3-colorable},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {2},
PAGES = {441-471},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Random graphs, Regular random graphs, Graph coloring, Threshold phenomena},
URL = {DOI:10.1016/S0022-0000(03)00120-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Guruswami-Khanna-Rajaraman-Shepherd-Yannakakis/03,
AUTHOR = {Guruswami, Venkatesan and Khanna, Sanjeev and Rajaraman, Rajmohan and Shepherd, Bruce and Yannakakis, Mihalis},
TITLE = {Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {3},
PAGES = {473-496},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Approximation algorithms, Bounded length edge-disjoint paths, Edge-disjoint paths, Hardness of approximation, Multicommodity flow, Network routing, Unsplittable flow, Vertex-disjoint paths},
URL = {DOI:10.1016/S0022-0000(03)00066-7},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ly/03,
AUTHOR = {Ly, Olivier},
TITLE = {Automatic graphs and D0L-sequences of finite graphs},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {3},
PAGES = {497-545},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Infinite graphs, Graph transformations, Automata, Logic},
URL = {DOI:10.1016/S0022-0000(03)00065-5},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jain-Kinber/03,
AUTHOR = {Jain, Sanjay and Kinber, Efim},
TITLE = {Intrinsic complexity of learning geometrical concepts from positive data},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {3},
PAGES = {546-607},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00067-9},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Homan-Thakur/03,
AUTHOR = {Homan, Christopher M. and Thakur, Mayur},
TITLE = {One-way permutations and self-witnessing languages},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {3},
PAGES = {608-622},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {One-way functions, Permutations, One-to-one functions, Complexity-theoretic cryptography, Self-witnessing languages},
URL = {DOI:10.1016/S0022-0000(03)00068-0},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Li-Liao-Yu/03,
AUTHOR = {Li, Chunguang and Liao, Xiaofeng and Yu, Juebang},
TITLE = {Complex-valued wavelet network},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {3},
PAGES = {623-632},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Neural network, Wavelet, Complex-valued, Identification},
URL = {DOI:10.1016/S0022-0000(03)00069-2},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Srinivasan/03,
AUTHOR = {Srinivasan, Aravind},
TITLE = {On the approximability of clique and related maximization problems},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {3},
PAGES = {633-651},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Inapproximability, Approximation algorithms, Clique, Independent set, Packing integer programs, Random sampling},
URL = {DOI:10.1016/S0022-0000(03)00110-7},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cesati/03,
AUTHOR = {Cesati, Marco},
TITLE = {The Turing way to parameterized complexity},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {654-685},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Parameterized complexity, W-class membership, Turing machine, Halting problem},
URL = {DOI:10.1016/S0022-0000(03)00073-4},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cotta-Moscato/03,
AUTHOR = {Cotta, Carlos and Moscato, Pablo},
TITLE = {The $k$-Feature Set problem is $W[2]$-complete},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {686-690},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {http://dx.doi.org/10.1016/S0022-0000(03)00081-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cheetham-Dehne-Rau-Chaplin-Stege-Taillon/03,
AUTHOR = {Cheetham, James and Dehne, Frank and Rau-Chaplin, Andrew and Stege, Ulrike and Taillon, Peter J.},
TITLE = {Solving large FPT problems on coarse-grained parallel machines},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {691-706},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00075-8},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Anand-Erlebach-Hall-Stefanakos/03,
AUTHOR = {Anand, R. Sai and Erlebach, Thomas and Hall, Alexander and Stefanakos, Stamatis},
TITLE = {Call control with $k$ rejections},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {707-722},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00076-X},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gramm-Niedermeier/03,
AUTHOR = {Gramm, Jens and Niedermeier, Rolf},
TITLE = {A fixed-parameter algorithm for minimum quartet inconsistency},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {723-741},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Computational biology, Minimum quartet inconsistency, Parameterized complexity, Phylogeny, Quartet methods},
URL = {DOI:10.1016/S0022-0000(03)00077-1},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Makowsky-Marino/03,
AUTHOR = {Makowsky, J.A. and Mari{\~n}o, J.P.},
TITLE = {The parametrized complexity of knot polynomials},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {742-756},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00080-1},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Pietrzak/03,
AUTHOR = {Pietrzak, Krzysztof},
TITLE = {On the parameterized complexity of the fixed alphabet},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {757-771},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Parameterized complexity, Longest common subsequence, Shortest common supersequence, Multiple sequence alignment},
URL = {DOI:10.1016/S0022-0000(03)00078-3},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Heusch-Porschen-Speckenmeyer/03,
AUTHOR = {Heusch, Peter and Porschen, Stefan and Speckenmeyer, Ewald},
TITLE = {Improving a fixed parameter tractability time bound for the shadow problem},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {772-788},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Shadow independent set, Shadow pattern, Pure implicational formula, Dynamic programming, Fixed parameter tractability},
URL = {DOI:10.1016/S0022-0000(03)00079-5},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Cai-Juedes/03,
AUTHOR = {Cai, Liming and Juedes, David},
TITLE = {On the existence of subexponential parameterized algorithms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {789-807},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
URL = {DOI:10.1016/S0022-0000(03)00074-6},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Alber-Fernau-Niedermeier/03,
AUTHOR = {Alber, Jochen and Fernau, Henning and Niedermeier, Rolf},
TITLE = {Graph separators: A parameterized view},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {808-832},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Planar graph problems, Fixed parameter tractability, Parameterized complexity, Graph separator theorems, Divide-and-conquer algorithms},
URL = {DOI:10.1016/S0022-0000(03)00072-2},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chen-Kanj/03,
AUTHOR = {Chen, Jianer and Kanj, Iyad A.},
TITLE = {Constrained minimum vertex cover in bipartite graphs: Complexity and parameterized algorithms},
JOURNAL = {J. Comput.~Syst.~Sci.},
VOLUME = {67},
NUMBER = {4},
PAGES = {833-847},
YEAR = {2003},
EDITOR = {Auer, Peter and Cesa-Bianchi, Nicol{\`o} and Gentile, Claudio},
KEYWORDS = {Vertex cover, Bipartite graph, Graph matching, Parameterized computation},
URL = {DOI:10.1016/j.jcss.2003.09.003},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}