default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 217
Volumes 217, Part 1, January 2017
- Bo Chen
, Peter Gritzmann, Silvano Martello:
Combinatorial optimization: theory, computation, and applications. 1-2 - Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
On the Shortest Path Game. 3-18 - Philipp Hungerländer:
New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem. 19-39 - Andrea Lodi, Michele Monaci, Enrico Pietrobuoni:
Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints. 40-47 - Pawel Obszarski, Andrzej Jastrzebski:
Edge-coloring of 3-uniform hypergraphs. 48-52 - Samuel Rosat, Issmail Elhallaoui, François Soumis, Driss Chakour:
Influence of the normalization constraint on the integral simplex using decomposition. 53-70 - Rebecca Sarto Basso, Vitaly A. Strusevich:
Differential approximation schemes for half-product related functions and their scheduling applications. 71-78
Volumes 217, Part 2, January 2017
- Miguel F. Anjos, Manuel V. C. Vieira:
On semidefinite least squares and minimal unsatisfiability. 79-96 - Kassie Archer:
Characterization of the allowed patterns of signed shifts. 97-109 - Devsi Bantva, Samir Vaidya, Sanming Zhou:
Radio number of trees. 110-122 - Emma Barme, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On a directed variation of the 1-2-3 and 1-2 Conjectures. 123-131 - Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
The price of connectivity for feedback vertex set. 132-143 - Peter G. Boyvalenkov, Tanya Marinova, Maya Stoyanova:
Nonexistence of a few binary orthogonal arrays. 144-150 - Denis Cornaz, Fabio Furini, Enrico Malaguti:
Solving vertex coloring problems as maximum weight stable set problems. 151-162 - Benoît Darties, Nicolas Gastineau, Olivier Togni:
Completely independent spanning trees in some regular graphs. 163-174 - Ewa Drgas-Burchardt, Katarzyna Gibek:
Harmonious colourings of graphs. 175-184 - Farzaneh Falahati Nezhad, Mahdieh Azari, Tomislav Doslic:
Sharp bounds on the inverse sum indeg index. 185-195 - Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo:
Chinese Postman Problem on edge-colored multigraphs. 196-202 - Shahab Haghi, Hamid Reza Maimani, Abbas Seify:
Star-critical Ramsey number of Fn versus K4. 203-209 - Nader Jafari Rad, Elahe Sharifi:
Bounds on the independence number of a graph in terms of order, size and maximum degree. 210-219 - Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
Circular-arc hypergraphs: Rigidity via connectedness. 220-228 - Xiang-Jun Li, Bin Liu, Meijie Ma, Jun-Ming Xu:
Many-to-many disjoint paths in hypercubes with faulty vertices. 229-242 - Fang-Yi Liao, Wai-Fong Chuan:
Q-Factorization of suffixes of two-way infinite extensions of irrational characteristic words. 243-260 - Marie MacCaig:
Exploring the complexity of the integer image problem in the max-algebra. 261-275 - Florian Martin:
Frustration and isoperimetric inequalities for signed graphs. 276-285 - Milica Milivojevic, Ljiljana Pavlovic:
The variation of the Randić index with regard to minimum and maximum degree. 286-293 - Enes Pasalic, Amela Muratovic-Ribic, Samir Hodzic, Sugata Gangopadhyay:
On derivatives of polynomials over finite fields through integration. 294-303 - James A. Tilley:
The a-graph coloring problem. 304-317 - Aleksandr Tuxanidy, Qiang Wang:
Compositional inverses and complete mappings over finite fields. 318-329 - Chia-Chen Wei, Sun-Yuan Hsieh:
h-restricted connectivity of locally twisted cubes. 330-339 - Birol Yüceoglu, Güvenç Sahin, Stan P. M. van Hoesel:
A column generation based algorithm for the robust graph coloring problem. 340-352
- Michal Lason, Wojciech Lubawski:
On-line list coloring of matroids. 353-355 - Gretchen L. Matthews:
Distance colorings of hypercubes from Z2Z4-linear codes. 356-361 - Charles Semple:
Size of a phylogenetic network. 362-367 - Hayk H. Tepanyan, Petros A. Petrosyan:
Interval edge-colorings of composition of graphs. 368-374 - Baoyindureng Wu, Clive Elphick:
Upper bounds for the achromatic and coloring numbers of a graph. 375-380 - Masaki Yamamoto:
Approximately counting paths and cycles in a graph. 381-387
Volumes 217, Part 3, January 2017
- Rim van Wersch, Steven Kelk:
ToTo: An open database for computation, storage and retrieval of tree decompositions. 389-393
- Jafar Amjadi, Leila Asgharsharghi, Nasrin Dehgardi, Michitaka Furuya, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
The k-rainbow reinforcement numbers in graphs. 394-404 - Ömür Arslan, Dan P. Guralnik, Daniel E. Koditschek:
Discriminative measures for comparison of phylogenetic trees. 405-426 - Sem C. Borst, Milan Bradonjic:
Scaling laws for maximum coloring of random geometric graphs. 427-437 - Marin Bougeret, Pascal Ochem:
The complexity of partitioning into disjoint cliques and a triangle-free graph. 438-445 - Domingos M. Cardoso, María Robbiano, Oscar Rojo:
Combinatorial and spectral properties of König-Egerváry graphs. 446-454 - Francis N. Castro, Luis A. Medina:
Modular periodicity of exponential sums of symmetric Boolean functions. 455-473 - José F. De Jesús, Alexander K. Kelmans:
On graphs uniquely defined by their K-circular matroids. 474-487 - Antoine Deza, Frantisek Franek:
Bannai et al. method proves the d-step conjecture for strings. 488-494 - Wei Dong, Wensong Lin:
On 2-distance coloring of plane graphs with girth 5. 495-505 - Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck:
Total domination in maximal outerplanar graphs. 506-511 - Steven T. Dougherty, Esengül Saltürk:
Codes over a family of local Frobenius rings, Gray maps and self-dual codes. 512-524 - Tatsuya Fukami, Norikazu Takahashi:
Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence. 525-535 - Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos:
A linear kernel for planar red-blue dominating set. 536-547 - Mei-Mei Gu, Rong-Xia Hao:
The pessimistic diagnosability of three kinds of graphs. 548-556 - Michael A. Henning, William F. Klostermeyer:
Italian domination in trees. 557-564 - Andreas M. Hinz, Sandi Klavzar, Sara Sabrina Zemljic:
A survey and classification of Sierpiński-type graphs. 565-600 - Hyun Jin Kim, Yoonjin Lee:
t-CIS codes over GF(p) and orthogonal arrays. 601-612 - Sandi Klavzar, Iztok Peterin, Ismael González Yero:
Graphs that are simultaneously efficient open domination and efficient closed domination graphs. 613-621 - Wenshui Lin, Peixi Li, Jianfeng Chen, Chi Ma, Yuan Zhang, Dongzhan Zhang:
On the minimal ABC index of trees with k leaves. 622-627 - Atílio G. Luiz, C. N. Campos, Célia Picinin de Mello:
AVD-total-chromatic number of some families of graphs with Δ(G)=3. 628-638 - Hamid Mokhtar, Sanming Zhou:
Recursive cubes of rings as models for interconnection networks. 639-662 - Jakub Przybylo, André Raspaud, Mariusz Wozniak:
On weight choosabilities of graphs with bounded maximum average degree. 663-672 - Amina Ramoul, Mostafa Blidia:
A new generalization of kernels in digraphs. 673-684 - Franca Rinaldi, Romeo Rizzi:
Solving the train marshalling problem by inclusion-exclusion. 685-690 - Shiying Wang, Zhenhua Wang, Mujiangshan Wang:
The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks. 691-706
- Abdo Y. Alfakih:
Graph connectivity and universal rigidity of bar frameworks. 707-710 - Eglantine Camby, Fränk Plein:
A note on an induced subgraph characterization of domination perfect graphs. 711-717 - Xue-Gang Chen, Ting Gao:
A note on α-total domination in cubic graphs. 718-721 - Kenji Mikawa, Ken Tanaka:
Linear-time generation of uniform random derangements encoded in cycle notation. 722-728
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-05 23:13 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.
