default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 117
Volume 117, Number 1-3, March 2002
- Alberto Caprara, Federico Malucelli
, Daniele Pretolani:
On bandwidth-2 graphs. 1-13 - Daniela Ferrero, Carles Padró:
Connectivity and fault-tolerance of hyperdigraphs. 15-26 - María Ángeles Garrido, Alberto Márquez, Aurora Morgana, José Ramón Portillo:
Single bend wiring on surfaces. 27-40 - Anahí Gajardo, Andrés Moreira, Eric Goles Ch.:
Complexity of Langton's ant. 41-50 - Eric Goles Ch., Michel Morvan, Ha Duong Phan:
Sandpiles and order structure of integer partitions. 51-64 - Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak:
Complexity of list coloring problems with a fixed total number of colors. 65-79 - Gregory Z. Gutin, Anders Yeo, Alexey Zverovich:
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. 81-86 - Pavol Hell, Moshe Rosenfeld:
Antidirected hamiltonian paths between specified vertices of a tournament. 87-98 - Petra Johann:
A group testing problem for graphs with several defective edges. 99-108 - P. Sreenivasa Kumar, C. E. Veni Madhavan:
Clique tree generalization and new subclasses of chordal graphs. 109-131 - Sang Kyu Lee, A. Duksu Oh, Hyeong-Ah Choi:
Transmission schedules for hypercube interconnection in WDM optical passive star networks. 133-148 - Vadim E. Levit, Eugen Mandrescu:
Combinatorial properties of the family of maximum stable sets of a graph. 149-161 - Chin Lung Lu, Chuan Yi Tang:
Weighted efficient domination problem on some perfect graphs. 163-182 - Jixiang Meng, Youhu Ji:
On a kind of restricted edge connectivity of graphs. 183-193 - Gur Mosheiov:
Complexity analysis of job-shop scheduling with deteriorating jobs. 195-209 - Rolf Niedermeier, Klaus Reinhardt, Peter Sanders:
Towards optimal locality in mesh-indexings. 211-237 - Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu:
On the robustness of primitive words. 239-252 - Benno Schwikowski, Ewald Speckenmeyer:
On enumerating all minimal solutions of feedback problems. 253-265 - Krisztián Tichler:
Minimum matrix representation of some key system. 267-277 - Svetlana N. Yanushkevich:
Matrix and combinatorics solutions of Boolean differential equations. 279-292 - Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
A note on reconfiguring tree linkages: trees can lock. 293-297
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 2026-08-02 01:05 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
