default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 256
Volume 256, March 2019
- Farid Alizadeh, Douglas Soares Gonçalves
, Nathan Krislock, Leo Liberti:
Preface. 1-4 - Jorge Alencar, Carlile Lavor, Leo Liberti:
Realizing Euclidean distance matrices by sphere intersection. 5-10 - Denis Cornaz, Youcef Magnouche, Ali Ridha Mahjoub, Sébastien Martin:
The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut. 11-37 - Adrian Dumitrescu:
Distinct distances and arithmetic progressions. 38-41 - Bill Jackson, J. C. Owen:
Equivalent realisations of a rigid graph. 42-58 - Bahman Kalantari:
An algorithmic separating hyperplane theorem and its applications. 59-82 - Lajos László:
On the Grace-Danielsson inequality for tetrahedra. 83-90 - Carlile Lavor, Leo Liberti, Bruce Randall Donald, Bradley Worley, Benjamin Bardiaux, Thérèse E. Malliavin, Michael Nilges:
Minimal NMR distance information for rigidity of protein graphs. 91-104 - Frank Plastria:
Pasting gauges I: Shortest paths across a hyperplane. 105-137 - Frank Plastria:
Pasting gauges II: Balls in pasted halfplanes. 138-156 - Rodrigo M. Zhou, Celina M. H. de Figueiredo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá:
On the embedding of cone graphs in the line with distinct distances between neighbors. 157-162
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 2024-11-14 21:05 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:
