default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 263
Volume 263, Number 1-2, July 2001
- Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert:
Preface. 1 - Hong-Gwa Yeh, Gerard J. Chang
:
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs. 3-8 - Komei Fukuda, Alain Prodon, Tadashi Sakuma:
Notes on acyclic orientations and the shelling lemma. 9-16 - Frank Nielsen:
On point covers of c-oriented polygons. 17-29 - Philippe Cara, Serge Lehman, Dmitrii V. Pasechnik:
On the number of inductively minimal geometries. 31-35 - Dmitrii V. Pasechnik:
On computing Hilbert bases via the Elliot-MacMahon algorithm. 37-46 - Reinhardt Euler:
Characterizing bipartite Toeplitz graphs. 47-58 - Venkataraman Yegnanarayanan:
Graph colourings and partitions. 59-74 - Yannis Manoussakis, Zsolt Tuza:
Ramsey numbers for tournaments. 75-85 - Gyula Károlyi, Vera Rosta:
Generalized and geometric Ramsey numbers for cycles. 87-98 - Guillaume Damiand, Michel Habib, Christophe Paul:
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. 99-111 - Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang:
Finding the shortest boundary guard of a simple polygon. 113-121 - Edward G. Belaga:
Mod 3 arithmetic on triangulated Riemann surfaces. 123-137 - Li-Da Tong, Frank K. Hwang, Gerard J. Chang:
Channel graphs of bit permutation networks. 139-143 - Hsien-Kuei Hwang:
Uniform asymptotics of some Abel sums arising in coding theory. 145-158 - Eric Angel, Vassilis Zissimopoulos:
On the landscape ruggedness of the quadratic assignment problem. 159-172 - Rabah Harbane, Marie-Claude Heydemann:
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. 173-189 - Alain Quilliot:
Convexity and global optimization: a theoretical link. 191-204 - Seiya Negami:
Note on Ramsey theorems for spatial graphs. 205-210 - Frank K. Hwang:
A complementary survey on double-loop networks. 211-229 - Bruno Martin:
A simulation of cellular automata on hexagons by cellular automata on rings. 231-234 - Patrice Calégari, Frédéric Guidec, Pierre Kuonen, Frank Nielsen:
Combinatorial optimization algorithms for radio network planning. 235-245 - Odile Favaron, Y. Redouane:
Neighborhood unions and regularity in graphs. 247-254 - Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
Partitioning vertices of 1-tough graphs into paths. 255-261 - Claude Indermitte, Thomas M. Liebling, Marc Troyanov, Heinz Clémençon:
Voronoi diagrams on piecewise flat surfaces and an application to biological growth. 263-274 - Roger K. Yeh:
Finite-dimensional T-colorings of graphs. 275-281 - Mordecai J. Golin:
A combinatorial approach to Golomb forests. 283-304 - Yasuko Matsui, Tomomi Matsui:
NP-completeness for calculating power indices of weighted majority games. 305-310 - Michio Ozeki:
On the covering radius problem for ternary self-dual codes. 311-332 - Hao Li, Jianping Li:
Independent triangles covering given vertices of a graph. 333-344 - Hiroshi Maehara, Norihide Tokushige:
When does a planar bipartite framework admit a continuous deformation? 345-354 - Szu-En Cheng, Ko-Wei Lih:
An improvement on a spernerity proof of Horrocks. 355-377
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-02 23:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
