More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

Discrete Applied Mathematics, Volume 115

> Home > Journals > Discrete Applied Mathematics

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 115, Number 1-3, November 2001

- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/AvisD01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AvisD01
David Avis, Antoine Deza:
On the binary solitaire cone. 3-14
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/BorosHRS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BorosHRS01
Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone:
Combinatorial problems related to origin-destination matrices. 15-36
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/FrankJS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/FrankJS01
András Frank, Tibor Jordán, Zoltán Szigeti:
Combinatorial problems related to origin-destination matrices. 37-47
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/GabowJ01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/GabowJ01
Harold N. Gabow, Tibor Jordán:
Bipartition constrained edge-splitting in directed graphs. 49-62
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/HiroHM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/HiroHM01
Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
Lengths of tours and permutations on a vertex set of a convex polygon. 63-71
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Kaneko01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Kaneko01
Atsushi Kaneko:
Spanning trees with constraints on the leaf degree. 73-76
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/KarolyiW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/KarolyiW01
Gyula Károlyi, Emo Welzl:
Crossing-free segments and triangles in point configurations. 77-88
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Kashiwabara01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Kashiwabara01
Kenji Kashiwabara:
Subdivisions of integral base polytopes. 89-97
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Katona01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Katona01
Gyula Y. Katona:
A large set of non-Hamiltonian graphs. 99-115
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/KloksT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/KloksT01
Ton Kloks, Richard B. Tan:
Bandwidth and topological bandwidth of graphs with few P4's. 117-133
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/KoideSI01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/KoideSI01
Tetsushi Koide, S. Shinmori, H. Ishii:
Topological optimization with a network reliability constraint. 135-149
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/MurotaS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/MurotaS01
Kazuo Murota, Akiyoshi Shioura:
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. 151-176
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/NishizekiVZ01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/NishizekiVZ01
Takao Nishizeki, Jens Vygen, Xiao Zhou:
The edge-disjoint paths problem is NP-complete for series-parallel graphs. 177-186
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Radics01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Radics01
Norbert Radics:
Rigidity of multi-story buildings. 187-198
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Recski01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Recski01
András Recski:
Some polynomially solvable subcases of the detailed routing problem in VLSI design. 199-208
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Sakuma01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Sakuma01
Tadashi Sakuma:
On kernel-less clique-acyclic orientations of minimally imperfect graphs. 209-219

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.