Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 157
Volume 157, Number 1, January 2009
- Jun Yan, Jun-Ming Xu, Chao Yang
:
Forwarding index of cube-connected cycles. 1-7 - Yaojun Chen, T. C. Edwin Cheng, Ran Xu:
The Ramsey number for a cycle of length six versus a clique of order eight. 8-12 - Dániel Marx, Marcus Schaefer:
The complexity of nonrepetitive coloring. 13-18 - Frédéric Gardi:
Mutual exclusion scheduling with interval graphs or related classes, Part I. 19-35 - Lali Barrière, Francesc Comellas, Cristina Dalfó, Miguel Angel Fiol:
The hierarchical product of graphs. 36-48 - Chase Rainwater, Joseph Geunes, H. Edwin Romeijn:
The generalized assignment problem with flexible jobs. 49-67 - Alexandre Dolgui, I. Ihnatsenka:
Balancing modular transfer lines with serial-parallel activation of spindle heads at stations. 68-89 - Aubin Jarry, Stéphane Pérennes:
Disjoint paths in symmetric digraphs. 90-97 - Michele Flammini, Alfredo Navarra:
Layouts for mobility management in wireless ATM networks. 98-111 - Zeev Nutov:
Listing minimal edge-covers of intersecting families with applications to connectivity problems. 112-117 - Xujin Chen, Guoli Ding, Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs. 118-125 - Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
On randomized broadcasting in Star graphs. 126-139 - Ji-Cherng Lin, Ming-Yi Chiu:
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model. 140-148 - Chandan K. Dubey, Shashank K. Mehta:
Critically indecomposable graphs. 149-163 - F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin:
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. 164-169 - Jun-Yo Chen, Ko-Wei Lih, Jiaojiao Wu:
Coloring the square of the Kneser graph I and the Schrijver graph I. 170-176 - Henning Fernau, Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Offensive r-alliances in graphs. 177-182 - André Renato Sales Amaral:
A new lower bound for the single row facility layout problem. 183-190 - Qizhong Lin, Yusheng Li:
On Ramsey numbers of fans. 191-194 - Weigen Yan, Yeong-Nan Yeh:
On the matching polynomial of subdivision graphs. 195-200
Volume 157, Number 2, January 2009
- Mark H. Siggers:
Dichotomy for bounded degree H-colouring. 201-210 - Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Global defensive k-alliances in graphs. 211-218 - José María Sigarreta, Juan Alberto Rodríguez-Velázquez:
On the global offensive alliance number of a graph. 219-226 - Hans-Jürgen Bandelt, Arne Röhl:
Quasi-median hulls in Hamming space are Steiner hulls. 227-233 - Ersoy Subasi, Munevver Mine Subasi, András Prékopa:
On strong unimodality of multivariate discrete distributions. 234-246 - Robin Nunkesser, Philipp Woelfel:
Representation of graphs by OBDDs. 247-261 - T. C. Edwin Cheng, Liying Kang, Erfang Shan:
A polynomial-time algorithm for the paired-domination problem on permutation graphs. 262-271 - Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi:
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. 272-279 - Claire Hanen, Alix Munier Kordon:
Periodic schedules for linear precedence constraints. 280-291 - Dong Ye, Heping Zhang:
2-extendability of toroidal polyhexes and Klein-bottle polyhexes. 292-299 - Lavanya Kannan, Arthur M. Hobbs, Hong-Jian Lai, Hongyuan Lai:
Transforming a graph into a 1-balanced graph. 300-308 - Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Highly connected random geometric graphs. 309-320 - Adrian Kosowski:
Forwarding and optical indices of a graph. 321-329 - Renu C. Laskar, Jeremy Lyle:
Fall colouring of bipartite graphs and cartesian products of graphs. 330-338 - Vladimir Kats, Eugene Levner:
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. 339-355 - Morteza Esmaeili, Ali Zaghian:
On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes. 356-363 - Andrei Tchernykh, Denis Trystram, Carlos A. Brizuela, Isaac D. Scherson:
Idle regulation in non-clairvoyant scheduling of parallel jobs. 364-376 - Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay:
Graph structural properties of non-Yutsis graphs allowing fast recognition. 377-386 - Hong-Bin Chen, Yongxi Cheng, Qian He, Chongchong Zhong:
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix. 387-390 - Jianping Ou:
On extremal unicyclic molecular graphs with maximal Hosoya index. 391-397 - Shinya Fujita, Ken-ichi Kawarabayashi:
Note on non-separating and removable cycles in highly connected graphs. 398-399 - Sogol Jahanbekam:
A comment to: Two classes of edge domination in graphs. 400-401 - Manjusri Basu, Md. M. Rahaman, Satya Bagchi:
On a new code, [2n-1, n, 2n-1]. 402-405 - Frédéric Giroire:
Order statistics and estimating cardinalities of massive data sets. 406-427 - Hyeonjin Kim, Sung-Mo Park, Sang Geun Hahn:
On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2. 428-432 - Wei Dong, Baogang Xu:
A note on list improper coloring of plane graphs. 433-436
Volume 157, Number 3, February 2009
- László G. Nyúl, Kálmán Palágyi:
Preface. 437 - Kees Joost Batenburg, Jan Sijbers:
Generic iterative subset algorithms for discrete tomography. 438-451 - Valentin E. Brimkov:
Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension. 452-463 - Srecko Brlek, Xavier Provençal, Jean-Marc Fedou:
On the tiling by translation problem. 464-475 - Martine Dexet, Eric Andres:
A generalized preimage for the digital analytical hyperplane recognition. 476-489 - Rocío González-Díaz, María José Jiménez, Belén Medrano, Pedro Real:
Chain homotopies for object topological representations. 490-499 - Damien Jamet, Jean-Luc Toutant:
Minimal arithmetic thickness connecting discrete planes. 500-509 - Gaëlle Largeteau-Skapin, Eric Andres:
Discrete-Euclidean operations. 510-523 - Hans Meine, Ullrich Köthe, Peer Stelldinger:
A topological sampling theorem for Robust boundary reconstruction and image segmentation. 524-541 - Samuel Peltier, Laurent Fuchs, Pascal Lienhardt:
Simploidals sets: Definitions, operations and comparison with simplicial sets. 542-557 - Isabelle Sivignon, David Coeurjolly:
Minimum decomposition of a digital surface into digital plane segments is NP-hard. 558-570 - Peter Veelaert, Kristof Teelen:
Feature controlled adaptive difference operators. 571-582
Volume 157, Number 4, February 2009
- Frank Gurski, Egon Wanke:
The NLC-width and clique-width for powers of graphs of bounded tree-width. 583-595 - Chunling Tong, Xiaohui Lin, Yuansheng Yang, Zhihe Li:
Equitable total coloring of CmCn. 596-601 - Ghassan Firro, Toufik Mansour:
Restricted k-ary words and functional equations. 602-616 - Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson:
Approximation algorithms for the weighted independent set problem in sparse graphs. 617-626 - Bruno Courcelle, Mamadou Moustapha Kanté:
Graph operations characterizing rank-width. 627-640 - Robin Strand:
Weighted distances based on neighborhood sequences for point-lattices. 641-652 - Jixiang Meng, Zhao Zhang:
Super-connected arc-transitive digraphs. 653-658 - Ken-ichi Kawarabayashi:
List-coloring graphs without K4, k-minors. 659-662 - Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang:
Injective coloring of planar graphs. 663-672 - Siamak Tazari, Matthias Müller-Hannemann:
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. 673-684 - Qinghai Liu, Yanmei Hong, Zhao Zhang:
Minimally 3-restricted edge connected graphs. 685-690 - Takuro Fukunaga, Hiroshi Nagamochi:
Eulerian detachments with local edge-connectivity. 691-698 - Boris A. Romov:
Homogeneous and strictly homogeneous criteria for partial structures. 699-709 - Xuding Zhu:
Bipartite density of triangle-free subcubic graphs. 710-714 - Hannes Moser, Somnath Sikdar:
The parameterized complexity of the induced matching problem. 715-727 - Alain Quilliot, Fatiha Bendali, Jean Mailfert:
Extended cooperative networks games. 728-737 - Christophe Meyer, Periklis A. Papakonstantinou:
On the complexity of constructing Golomb Rulers. 738-748 - Hong Seo Ryoo, In-Yong Jang:
MILP approach to pattern generation in logical analysis of data. 749-761 - David E. Brown, J. Richard Lundgren, Li Sheng:
A characterization of cycle-free unit probe interval graphs. 762-767 - Martin Gavalec, Ján Plávka:
Structure and dimension of the eigenspace of a concave Monge matrix. 768-773 - Siham Bekkai, Mekkia Kouider:
On pseudo 2-factors. 774-779 - Frédéric Meunier, András Sebö:
Paintshop, odd cycles and necklace splitting. 780-793 - Mehdi Eliasi, Bijan Taeri:
Four new sums of graphs and their Wiener indices. 794-803 - M. H. Khalifeh, Hassan Yousefi-Azari, A. R. Ashrafi:
The first and second Zagreb indices of some graph operations. 804-811 - V. N. Muralidhara, Sandeep Sen:
Improvements on the Johnson bound for Reed-Solomon codes. 812-818 - Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. 819-832 - M. R. Darafsheh:
Groups with the same non-commuting graph. 833-837 - Helmuth R. Malonek, Graça Tomaz:
Bernoulli polynomials and Pascal matrices in the context of Clifford analysis. 838-847
- Svetlana A. Kravchenko, Frank Werner:
On a parallel machine scheduling problem with equal processing times. 848-852 - Frantisek Galcík:
A note on the lower bound of centralized radio broadcasting for planar reachability graphs. 853-857 - Pierangela Veneziani:
Upper bounds of degree 3 for the probability of the union of events via linear programming. 858-863 - Mariusz Startek, Andrzej Wloch, Iwona Wloch:
Fibonacci numbers and Lucas numbers in graphs. 864-868 - Xueliang Li, Jianbin Zhang, Lusheng Wang:
On bipartite graphs with minimal energy. 869-873
Volume 157, Number 5, March 2009
- Zhengbing Bian, Qian-Ping Gu, Xiao Zhou:
Efficient algorithms for wavelength assignment on trees of rings. 875-889 - Francine Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas, Margaret Moorefield:
Unbordered partial words. 890-900 - Jack Brimberg, Henrik Juel, Anita Schöbel:
Locating a minisum circle in the plane. 901-912 - Yinmei Cao, Anhua Lin, Rong Luo, Xiaoya Zha:
On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures. 913-919 - Gi-Sang Cheon, Hana Kim, Louis W. Shapiro:
A generalization of Lucas polynomial sequence. 920-927 - Giovanni Di Crescenzo, Clemente Galdi:
Hypergraph decomposition and secret sharing. 928-946 - Joanna Górska, Zdzislaw Skupien:
Inducing regulation of any digraphs. 947-952 - Stepan Holub, Kalle Saari:
On highly palindromic words. 953-959 - Raja Jothi, Balaji Raghavachari:
Degree-bounded minimum spanning trees. 960-970 - Mahdad Khatirinejad, Petr Lisonek:
Linear codes for high payload steganography. 971-981 - Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan:
Hamiltonian connectedness in 3-connected line graphs. 982-990 - Isabella Lari, Maurizio Maravalle, Bruno Simeone:
Computing sharp bounds for hard clustering problems on trees. 991-1008 - Hao Li, Mei Lu:
Bi-cycle extendable through a given set in balanced bipartite graphs. 1009-1015 - Xiaohui Lin, Yuansheng Yang, Wenping Zheng, Lei Shi, Weiming Lu:
The crossing numbers of generalized Petersen graphs with small order. 1016-1023 - Aygul Mamut, Qiongxiang Huang, Fenjin Liu:
Enumeration of 2-regular circulant graphs and directed double networks. 1024-1033 - Dániel Marx:
Complexity results for minimum sum edge coloring. 1034-1045 - Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao:
Linear CNF formulas and satisfiability. 1046-1068 - Justo Puerto, Federica Ricca, Andrea Scozzari:
Extensive facility location problems on networks with equity measures. 1069-1085 - Palash Sarkar:
Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration. 1086-1097 - Erfang Shan, T. C. Edwin Cheng:
Upper bounds on the upper signed total domination number of graphs. 1098-1103 - Munevver Mine Subasi, Ersoy Subasi, Martin Anthony, Peter L. Hammer:
Using a similarity measure for credible classification. 1104-1112 - Fang Tian, Jun-Ming Xu:
Average distances and distance domination numbers. 1113-1127 - Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten:
A flexible model and efficient solution strategies for discrete location problems. 1128-1145 - Katalin M. Hangos, Zsolt Tuza, Anders Yeo:
Some complexity problems on single input double output controllers. 1146-1158 - Li-Da Tong:
The forcing hull and forcing geodetic numbers of graphs. 1159-1163
Volume 157, Number 6, March 2009
- Leo Liberti, Nelson Maculan:
Reformulation techniques in mathematical programming. 1165-1166 - Hatem Ben Amor, Jacques Desrosiers, Antonio Frangioni:
On the choice of explicit stabilizing terms in column generation. 1167-1184 - Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau:
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. 1185-1197 - Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende:
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. 1198-1217 - Peter Damaschke:
Ranking hypotheses to minimize the search cost in probabilistic inference models. 1218-1228 - Antonio Frangioni, Bernard Gendron:
0-1 reformulations of the multicommodity capacitated network design problem. 1229-1241 - András Frank:
Rooted k-connections in digraphs. 1242-1254 - Serigne Gueye, Philippe Michelon:
A linearization framework for unconstrained quadratic (0-1) problems. 1255-1266 - Pierre Hansen, Christophe Meyer:
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem. 1267-1290 - Brigitte Jaumard, Christophe Meyer, Babacar Thiongane:
On column generation formulations for the RWA problem. 1291-1308 - Leo Liberti, Carlile Lavor, Nelson Maculan, Marco Antonio Chaer Nascimento:
Reformulation in mathematical programming: An application to quantum chemistry. 1309-1318 - Hanif D. Sherali, Warren P. Adams:
A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions. 1319-1333
Volume 157, Number 7, April 2009
- Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey:
Corrigendum to "Variable space search for graph coloring" [Discrete Appl. Math. 156 (2008) 2551-2560]. 1335-1336 - Bo-Jr Li, Gerard J. Chang:
The competition number of a graph with exactly h holes, all of which are independent. 1337-1341 - Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu:
On the spanning fan-connectivity of graphs. 1342-1348 - Camino Balbuena, Jianmin Tang, Kim Marshall, Yuqing Lin:
Superconnectivity of regular graphs with small diameter. 1349-1353 - Shuhong Gao, D. Frank Hsu:
Short containers in Cayley graphs. 1354-1363 - J. Studenovský:
Polynomial reduction of time-space scheduling to time scheduling. 1364-1378 - Xiaodan Chen, Jianguo Qian:
Conjugated trees with minimum general Randic index. 1379-1386 - Shuchao Li, Zhongxun Zhu:
The number of independent sets in unicyclic graphs with a given diameter. 1387-1395 - Frédéric Chataigner, Gordana Manic, Yoshiko Wakabayashi, Raphael Yuster:
Approximation algorithms and hardness results for the clique packing problem. 1396-1406 - Srikrishnan Divakaran:
Approximation algorithms for constrained generalized tree alignment problem. 1407-1422 - Toru Hasunuma:
Improved book-embeddings of incomplete hypercubes. 1423-1431 - Stephane Durocher, Christophe Paul:
Kinetic maintenance of mobile k-centres on trees. 1432-1446 - Alain Gély, Lhouari Nourine, Bachir Sadi:
Enumeration aspects of maximal cliques and bicliques. 1447-1459 - Matthias Hagen:
Lower bounds for three algorithms for transversal hypergraph generation. 1460-1469 - Bodo Manthey:
Minimum-weight cycle covers and their approximability. 1470-1480 - Demetres Christofides:
On randomized algorithms for the majority problem. 1481-1485 - Paul D. Manuel, Indra Rajasingh, Bharati Rajan, Helda Mercy:
Exact wirelength of hypercubes on a grid. 1486-1495 - Josep Freixas, Xavier Molinero:
Simple games and weighted games: A theoretical and computational viewpoint. 1496-1508 - Clemens Huemer, Ferran Hurtado, Marc Noy, Elsa Omaña-Pulido:
Gray codes for non-crossing partitions and dissections of a convex polygon. 1509-1520 - Nissan Lev-Tov, David Peleg:
Conflict-free coloring of unit disks. 1521-1532 - Ryuhei Uehara, Yushi Uno:
Laminar structure of ptolemaic graphs with applications. 1533-1543 - Stephan G. Wagner, Hua Wang, Gang Yu:
Molecular graphs and the inverse Wiener index problem. 1544-1554 - Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul:
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. 1555-1570 - A. P. Santhakumaran, P. Titus, Johnson John:
The upper connected geodetic number and forcing connected geodetic number of a graph. 1571-1580 - Hong-Bin Chen, Hung-Lin Fu:
Nonadaptive algorithms for threshold group testing. 1581-1585 - Camino Balbuena, Diego González-Moreno, Xavier Marcote:
On the 3-restricted edge connectivity of permutation graphs. 1586-1591 - Tomás Feder, Pavol Hell, Jing Huang:
Extension problems with degree bounds. 1592-1599 - Toufik Mansour, Matthias Schork:
The vertex PI index and Szeged index of bridge graphs. 1600-1606 - Robert Willenbring:
RNA secondary structure, permutations, and statistics. 1607-1614 - Paul A. Dreyer Jr., Fred S. Roberts:
Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. 1615-1627 - Bo Zhou, Xiaochun Cai, Nenad Trinajstic:
On reciprocal complementary Wiener number. 1628-1633 - Adriana Hansberg, Lutz Volkmann:
Upper bounds on the k-domination number and the k-Roman domination number. 1634-1639
- Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
An improved randomized approximation algorithm for maximum triangle packing. 1640-1646 - Nader Jafari Rad:
On the diameter of a domination dot-critical graph. 1647-1649 - Lingli Sun, Ting Chen:
Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees. 1650-1654 - Richard Denman, Stephen Foster:
Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. 1655-1659 - Gregory Z. Gutin, Anders Yeo:
On the number of connected convex subgraphs of a connected acyclic digraph. 1660-1662 - Hong-Gwa Yeh:
A connection between circular colorings and periodic schedules. 1663-1668
- Arseny M. Shur:
On intermediate factorial languages. 1669-1675
Volume 157, Number 8, April 2009
- Toru Araki:
Labeling bipartite permutation graphs with a condition at distance two. 1677-1686 - José María Sigarreta, Sergio Bermudo, Henning Fernau:
On the complement graph and defensive k-alliances. 1687-1695 - Gi-Sang Cheon, Sung-Tae Jin, Hana Kim, Louis W. Shapiro:
Riordan group involutions and the Delta-sequence. 1696-1701 - Geir Dahl:
Disjoint congruence classes and a timetabling application. 1702-1710 - Sabine Cornelsen, Gabriele Di Stefano:
Treelike comparability graphs. 1711-1722 - Luca Giuzzi, Angelo Sonnino:
LDPC codes from Singer cycles. 1723-1728 - Huifang Miao, Xiaofeng Guo:
Optimal strong (kappa, d)-orientation of complete k-partite graphs. 1729-1736 - Louis Ibarra:
The clique-separator graph for chordal graphs. 1737-1749 - Yi-Ting Chen, Ma-Lian Chia, David Kuo:
L(p, q)-labeling of digraphs. 1750-1759 - Yuqing Lin, Camino Balbuena, Mirka Miller:
On the number of components of (k, g)-cages after vertex deletion. 1760-1765 - Zhifu You, Bolian Liu:
On a conjecture of the Randic index. 1766-1772 - Magnús M. Halldórsson, Elena Losievskaja:
Independent sets in bounded-degree hypergraphs. 1773-1786 - Mostafa Blidia, Frédéric Maffray, Zoham Zemir:
On b-colorings in regular graphs. 1787-1793 - Dara Moazzami, Behzad Salehian:
Some results related to the tenacity and existence of k-trees. 1794-1798 - Masataka Nakamura:
On the NBC-complexes and beta-invariants of abstract convex geometries. 1799-1805 - C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov:
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. 1806-1824 - L. L. Liu, C. T. Ng, T. C. Edwin Cheng:
Scheduling jobs with release dates on parallel batch processing machines. 1825-1830 - Beth Novick:
Norm statistics and the complexity of clustering problems. 1831-1839 - Guy Kortsarz, Zeev Nutov:
Approximating minimum-power edge-covers and 2, 3-connectivity. 1840-1847 - Laurent Poinsot:
A new characterization of group action-based perfect nonlinearity. 1848-1857 - Luisa Gargano, Adele A. Rescigno:
Collision-free path coloring with application to minimum-delay gathering in sensor networks. 1858-1872 - Alan Shuchat, Randy Shull, Ann N. Trenk:
Fractional weak discrepancy and interval orders. 1873-1884 - Satoshi Tayu, Kumiko Nomura, Shuichi Ueno:
On the two-dimensional orthogonal drawing of series-parallel graphs. 1885-1895 - Gerard J. Chang, Changhong Lu, Sanming Zhou:
Distance-two labellings of Hamming graphs. 1896-1904 - Dirk Meierling, Lutz Volkmann, Stephan Zitzen:
The signed domatic number of some regular graphs. 1905-1912 - Öznur Yasar, Danny Dyer, David A. Pike, Margo Kondratieva:
Edge searching weighted graphs. 1913-1923 - Cheng-Ju Hsu, Fu-Hsing Wang, Yue-Li Wang:
Global defensive alliances in star graphs. 1924-1931 - Chunling Tong, Xiaohui Lin, Yuansheng Yang, Meiqin Luo:
2-rainbow domination of generalized Petersen graphs P(n, 2). 1932-1937 - Jia Huang, Jian-Wei Wang, Jun-Ming Xu:
Reinforcement numbers of digraphs. 1938-1946
- Xiaohan Wang, Xiaolin Wu, Sorina Dumitrescu:
On explicit formulas for bandwidth and antibandwidth of hypercubes. 1947-1952 - Yongqiang Zhao, Gerard J. Chang:
Note on the m-step competition numbers of paths and cycles. 1953-1958 - Cédric Bentz:
A simple algorithm for multicuts in planar graphs with outer terminals. 1959-1964 - Bill Jackson, Tibor Jordán:
A sufficient connectivity condition for generic rigidity in the plane. 1965-1968 - Michael A. Henning, Nader Jafari Rad:
On total domination vertex critical graphs of high connectivity. 1969-1973 - Toufik Mansour, Chunwei Song:
New permutation statistics: Variation and a variant. 1974-1978
Volume 157, Number 9, May 2009
- Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Van Bang Le:
Preface. 1979 - Stephan Dominique Andres:
The incidence game chromatic number. 1980-1987 - Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos:
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. 1988-1992 - Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier:
Algorithmic aspects of a general modular decomposition theory. 1993-2009 - Colin Cooper, Michele Zito:
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. 2010-2014 - Konrad Engel:
Optimal matrix-segmentation by rectangles. 2015-2030 - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Intersection models of weakly chordal graphs. 2031-2047 - Hans-Dietrich O. F. Gronau, Markus Schmidmeier:
Orthogonal covers by multiplication graphs. 2048-2056 - Pinar Heggernes, Federico Mancini:
Dynamically maintaining split graphs. 2057-2069 - Csanád Imreh:
Online scheduling with general machine cost functions. 2070-2077 - Masaru Iwasa, Hiroo Saito, Tomomi Matsui:
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. 2078-2088 - Thomas Kalinowski:
The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence. 2089-2104 - Axel Kohnert, Sascha Kurz:
Integral point sets over Znm. 2105-2117 - Axel Kohnert, Alfred Wassermann:
Construction of binary and ternary self-orthogonal linear codes. 2118-2123 - Yusuke Kuroki, Tomomi Matsui:
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. 2124-2135 - Reinhard Laue:
t-wise balanced designs. 2136-2142 - Florin Manea, Carlos Martín-Vide, Victor Mitrana:
On some algorithmic problems regarding the hairpin completion. 2143-2152 - B. S. Panda, Anita Das:
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. 2153-2169 - Jianguo Qian, Konrad Engel, Wei Xu:
A generalization of Sperner's theorem and an application to graph orientations. 2170-2176 - Andreas H. Ronneseth, Charles J. Colbourn:
Merging covering arrays and compressing multiple sequence alignments. 2177-2190 - Hasmik Sahakyan:
Numerical characterization of n-cube subset partitioning. 2191-2197 - Jianmin Tang, Yuqing Lin, Camino Balbuena, Mirka Miller:
Calculating the extremal number ex(v;{C3, C4, ..., Cn}). 2198-2206 - Elias Wegert, Christian Reiher:
Relaxation procedures on graphs. 2207-2216
Volume 157, Number 10, May 2009
- Andreas W. M. Dress, Bülent Karasözen, Peter F. Stadler, Gerhard-Wilhelm Weber:
Preface. 2217-2220 - Jacek Blazewicz, Dorota Formanowicz, Piotr Formanowicz, Andrea Sackmann, Michal Sajkowski:
Modeling the process of human body iron homeostasis using a variant of timed Petri nets. 2221-2231 - Jutta Gebert, Nicole Radde, Ulrich Faigle, Julia Strösser, Andreas Burkovski:
Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum. 2232-2243 - Francisco J. Planes, John E. Beasley:
Path finding approaches and metabolic pathways. 2244-2256 - Abdelhalim Larhlimi, Alexander Bockmayr:
A new constraint-based description of the steady-state flux cone of metabolic networks. 2257-2266 - Etienne Birmelé:
A scale-free graph model based on bipartite graphs. 2267-2284 - Nicole Radde, Lars Kaderali:
Inference of an oscillating model for the yeast cell cycle. 2285-2295 - Jerry L. R. Chandler:
An introduction to the perplex number system. 2296-2309 - Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. 2310-2324 - Stefan Grünewald, Vincent Moulton, Andreas Spillner:
Consistency of the QNet algorithm for generating planar split networks from weighted quartets. 2325-2334 - Evren Koban, Çigdem Gökçek Saraç, Sinan Can Açan, Peter Savolainen, Inci Togan:
Genetic relationship between Kangal, Akbash and other dog populations. 2335-2340 - Ceren Caner Berkman, Inci Togan:
The Asian contribution to the Turkish population with respect to the Balkans: Y-chromosome perspective. 2341-2348 - Andreas W. M. Dress:
Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support. 2349-2360 - Ulrik Brandes, Sabine Cornelsen:
Phylogenetic graph models beyond trees. 2361-2369 - Alexander Bolshoy, Zeev Volkovich:
Whole-genome prokaryotic clustering based on gene lengths. 2370-2377 - Limor Kozobay-Avraham, Sergey Hosid, Zeev Volkovich, Alexander Bolshoy:
Prokaryote clustering based on DNA curvature distributions. 2378-2387 - Süreyya Özögür-Akyüz, John Shawe-Taylor, Gerhard-Wilhelm Weber, Z. B. Ögel:
Pattern analysis for the prediction of fungal pro-peptide cleavage sites. 2388-2394 - Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. Das:
Parametric modeling of protein-DNA binding kinetics: A discrete event based simulation approach. 2395-2415 - Murat Ali Bayir, Tacettin Dogacan Guney, Tolga Can:
Integration of topological measures for eliminating non-specific interactions in protein interaction networks. 2416-2424 - Anirban Banerjee, Jürgen Jost:
Graph spectra as a systematic tool in computational biology. 2425-2431 - Konstantin Klemm, Peter F. Stadler:
A note on fundamental, non-fundamental, and robust cycle bases. 2432-2438 - Nihat Ay:
A refinement of the common cause principle. 2439-2457 - Axel Mosig, Türker Bíyíkoglu, Sonja J. Prohaska, Peter F. Stadler:
Discovering cis-regulatory modules by optimizing barbecues. 2458-2468 - Guglielmo Lulli, Martin Romauch:
A mathematical program to refine gene regulatory networks. 2469-2482 - Ugur Kaplan, Metin Türkay, Lorenz T. Biegler, Bülent Karasözen:
Modeling and simulation of metabolic networks for estimation of biomass accumulation parameters. 2483-2493 - Gerhard-Wilhelm Weber, Ömür Ugur, Pakize Taylan, Aysun Tezel:
On optimization, dynamics and uncertainty: A tutorial for gene-environment networks. 2494-2513
Volume 157, Number 11, June 2009
- Daniel Andrén, Klas Markström:
The bivariate Ising polynomial of a graph. 2515-2524 - Nicola Apollonio, Paolo Giulio Franciosa:
On the complexity of recognizing directed path families. 2525-2535 - Jørgen Bang-Jensen:
k-strong spanning local tournaments in locally semicomplete digraphs. 2536-2540 - Gerardo Berbeglia, Gena Hahn:
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete. 2541-2547
- James D. Currie, Narad Rampersad:
There are k-uniform cubefree binary morphisms for all k>=0. 2548-2551 - Adrian Kosowski:
A note on the strength and minimum color sum of bipartite graphs. 2552-2554 - Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
Security number of grid-like graphs. 2555-2561 - Andrey Rukhin, Carey E. Priebe, Dennis M. Healy Jr.:
On the monotone likelihood ratio property for the convolution of independent binomial random variables. 2562-2564 - Khaled Salem, Sandi Klavzar, Aleksander Vesel, Petra Zigert:
The Clar formulas of a benzenoid system and the resonance graph. 2565-2569 - Guangjun Xu:
2-rainbow domination in generalized Petersen graphs P(n, 3). 2570-2573
Volume 157, Number 12, June 2009
- Jan Kratochvíl, Andrzej Proskurowski, Oriol Serra:
Guest editors' foreword. 2575-2576
- Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
Tree-width of graphs without a 3×3 grid minor. 2577-2596 - Tomás Kaiser:
Minors of simplicial complexes. 2597-2602 - Nicolas Nisse:
Connected graph searching in chordal graphs. 2603-2610 - David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
On probe permutation graphs. 2611-2619 - Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning graphs of supply and demand. 2620-2633
- Zdenek Dvorák, Daniel Král, Pavel Nejedlý, Riste Skrekovski:
Distance constrained labelings of planar graphs with no short cycles. 2634-2645 - Jerrold R. Griggs, Daniel Král:
Graph labellings with variable weights, a survey. 2646-2658 - Pinar Heggernes, Federico Mancini:
Minimal split completions. 2659-2669 - Daniel Lokshtanov:
Finding the longest isometric cycle in a graph. 2670-2674 - Bruno Courcelle:
Linear delay enumeration and monadic second-order logic. 2675-2700 - Michele Flammini, Mordechai Shalom, Shmuel Zaks:
On minimizing the number of ADMs in a general topology optical network. 2701-2717
- Christophe Paul, Jan Arne Telle:
Branchwidth of chordal graphs. 2718-2725 - Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca:
Computing branchwidth via efficient triangulations and blocks. 2726-2736 - Frederic Dorn, Jan Arne Telle:
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. 2737-2746 - Marcin Kaminski, Vadim V. Lozin, Martin Milanic:
Recent developments on graphs of bounded clique-width. 2747-2761
Volume 157, Number 13, July 2009
- Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Optical grooming with grooming ratio eight. 2763-2772 - Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart:
On the degree distance of a graph. 2773-2777 - Dingzhu Du, Lan Shen, Yingqian Wang:
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. 2778-2784 - Leah Epstein, Elena Kleiman:
Resource augmented semi-online bounded space bin packing. 2785-2798 - Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
On well-covered triangulations: Part II. 2799-2817 - Stephan Foldes, Peter L. Hammer:
Algebraic and topological closure conditions for classes of pseudo-Boolean functions. 2818-2827 - Boris Furtula, Ante Graovac, Damir Vukicevic:
Atom-bond connectivity index of trees. 2828-2835 - Vladimir Gurvich, Igor E. Zverovich:
Neighborhood hypergraphs of digraphs and some matrix permutation problems. 2836-2845 - Johannes H. Hattingh, Ernst J. Joubert:
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree. 2846-2858 - Frédéric Havet, Stéphan Thomassé:
Complexity of (p, 1)-total labelling. 2859-2870 - Petr Kolman, Ondrej Pangrác:
On the complexity of paths avoiding forbidden pairs. 2871-2876 - Shuchao Li, Xuechao Li, Wei Jing:
On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs. 2877-2885 - Arthur L. Liestman, Dana S. Richards, Ladislav Stacho:
Broadcasting from multiple originators. 2886-2891 - Reza Sobhani, Morteza Esmaeili:
Cyclic and negacyclic codes over the Galois ring GR(p2, m). 2892-2903 - Ran Tian:
The mathematical solution of a cellular automaton model which simulates traffic flow with a slow-to-start effect. 2904-2917 - Heping Zhang, Yujun Yang, Chuanwen Li:
Kirchhoff index of composite graphs. 2918-2927 - Xiao-Dong Zhang:
The signless Laplacian spectral radius of graphs with given degree sequences. 2928-2937 - Ljiljana Pavlovic, Mirjana Lazic, Tatjana M. Aleksic:
More on "Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index". 2938-2944 - Richard Emilion, Gérard Lévy:
Size of random Galois lattices and number of closed frequent itemsets. 2945-2957
- Shane Dye:
A note on the minimum bounded edge-partition of a tree. 2958-2963 - Michael A. Henning, Simon Mukwembi:
Domination, radius, and minimum degree. 2964-2968 - Hsin-Hao Lai, Ko-Wei Lih, Li-Da Tong:
Full orientability of graphs with at most one dependent arc. 2969-2972 - Ludovít Niepel, Martin Knor:
Domination in a digraph and in its reverse. 2973-2977 - Yoshio Sano:
Characterizations of competition multigraphs. 2978-2982 - Mirka Miller, Guillermo Pineda-Villavicencio:
Complete catalogue of graphs of maximum degree 3 and defect at most 4. 2983-2996 - Tomohiro Sogabe, Moawwad El-Mikkawy:
On a problem related to the Vandermonde determinant. 2997-2999
- Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim:
On complexity of Minimum Leaf Out-Branching problem. 3000-3004
Volume 157, Number 14, July 2009
- Saieed Akbari, Maryam Ghanbari, Sogol Jahanbekam:
On the list dynamic coloring of graphs. 3005-3007 - T. L. Alderson, Keith E. Mellinger:
2-dimensional optical orthogonal codes from singer groups. 3008-3019 - Angela Angeleska, Natasa Jonoska, Masahico Saito:
DNA recombination through assembly graphs. 3020-3037 - Yujuan Bai, Tayuan Huang, Kaishun Wang:
Error-correcting pooling designs associated with some distance-regular graphs. 3038-3045 - Xiaochun Cai, Bo Zhou:
Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs. 3046-3054 - Dominik D. Freydenberger, Daniel Reidenbach:
The unambiguity of segmented morphisms. 3055-3068 - Vladimir Gurvich:
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited. 3069-3085 - Johannes H. Hattingh, Michael A. Henning:
Bounds relating the weakly connected domination number to the total domination number and the matching number. 3086-3093 - Sun-Yuan Hsieh, Che-Nan Kuo, Hui-Ling Huang:
1-vertex-fault-tolerant cycles embedding on folded hypercubes. 3094-3098 - Xian'an Jin, Fengming Dong, Eng Guan Tay:
On graphs determining links with maximal number of components via medial construction. 3099-3110 - Raffaele Scapellato, Ramadan A. El-Shanawany, Mahmoud Shibl Higazy:
Orthogonal double covers of Cayley graphs. 3111-3118 - Rüdiger Stephan:
Facets of the (s, t)-p-path polytope. 3119-3132 - Hande Yaman:
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution. 3133-3151 - Dong Ye, Heping Zhang:
Extremal fullerene graphs with the maximum Clar number. 3152-3173
- Andrei Asinowski, Andrew Suk:
Edge intersection graphs of systems of paths on a grid with a bounded number of bends. 3174-3180 - Telikepalli Kavitha, Meghana Nasre:
Optimal popular matchings. 3181-3186
Volume 157, Number 15, August 2009
- Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi:
Optimal receiver scheduling algorithms for a multicast problem. 3187-3197 - Joanna Cyman, Joanna Raczek:
Total outer-connected domination numbers of trees. 3198-3202 - John P. Georges, David W. Mauro, Yan Wang:
Labeling the r-path with a condition at distance two. 3203-3215 - Haim Kaplan, Yahav Nussbaum:
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. 3216-3230 - Yusuke Kobayashi:
Induced disjoint paths problem in a planar digraph. 3231-3238 - Vichian Laohakosol, Pinthira Tangsupphathawat:
Positivity of third order linear recurrence sequences. 3239-3248 - You Lu, Jun-Ming Xu, Xinmin Hou:
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs. 3249-3257 - Dániel Marx, Ildikó Schlotter:
Parameterized graph cleaning problems. 3258-3267 - John McCoy, Michael A. Henning:
Locating and paired-dominating sets in graphs. 3268-3280 - Adrien Richard:
Positive circuits and maximal number of fixed points in discrete dynamical systems. 3281-3288 - Henning Wunderlich:
On cover-structure graphs. 3289-3299 - Haiyan Xu, Keith W. Hipel, D. Marc Kilgour:
Multiple levels of preference in interactive strategic decisions. 3300-3313
- Éva Czabarka, László A. Székely, Stephan G. Wagner:
The inverse problem for certain tree parameters. 3314-3319 - Konstantinos Drakakis, Rod Gow, Gary McGuire:
APN permutations on Zn and Costas arrays. 3320-3326 - Tamás Király, Júlia Pap:
A note on kernels and Sperner's Lemma. 3327-3331 - Xueliang Li, Jianxi Liu:
A proof of a conjecture on the Randic index of graphs with given girth. 3332-3335 - Jeremy Lyle, Wayne Goddard:
The binding number of a graph and its cliques. 3336-3340 - Cynthia Vinzant:
Lower bounds for optimal alignments of binary sequences. 3341-3346 - Stanislav Zivný, David A. Cohen, Peter G. Jeavons:
The expressive power of binary submodular functions. 3347-3358
Volume 157, Number 16, August 2009
- Valentin E. Brimkov, Reneta P. Barneva:
Combinatorial approach to image analysis. 3359-3361 - Tetsuo Asano, Valentin E. Brimkov, Reneta P. Barneva:
Some theoretical challenges in digital geometry: A perspective. 3362-3371 - Anvesh Komuravelli, Arnab Sinha, Arijit Bishnu:
Connectivity preserving transformations for higher dimensional binary images. 3372-3385 - Robin Strand, Benedek Nagy:
Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids. 3386-3400 - K. G. Subramanian, Rosihan M. Ali, M. Geethalakshmi, Atulya K. Nagar:
Pure 2D picture grammars and languages. 3401-3411 - Jérôme Darbon:
Global optimization for first order Markov Random Fields with submodular priors. 3412-3423 - Petra Wiederhold, Sandino Morales:
Thinning on cell complexes from polygonal tilings. 3424-3434 - Alexandre Dupas, Guillaume Damiand:
Region merging with topological control. 3435-3446 - Péter Balázs:
A benchmark set for the reconstruction of hv-convex discrete sets. 3447-3456 - Kristof Teelen, Peter Veelaert:
Computing regions of interest for geometric features in digital images. 3457-3472 - Emilie Charrier, Lilian Buzer:
Approximating a real number by a rational number with a limited denominator: A geometric approach. 3473-3484 - Henrik Schulz:
Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets. 3485-3493
Volume 157, Number 17, October 2009
- Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer:
Foreword. 3495-3496 - Mustapha Aouchiche, Odile Favaron, Pierre Hansen:
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance. 3497-3510 - Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs. 3511-3518 - Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray:
On minimally b-imperfect graphs. 3519-3530 - Andrea Scozzari, Fabio Tardella:
On the complexity of some subgraph problems. 3531-3539 - Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. 3540-3551 - Nicolas Derhy, Christophe Picouleau:
Finding induced trees. 3552-3557 - Cédric Bentz:
Disjoint paths in sparse graphs. 3558-3568 - Naoki Katoh, Shin-ichi Tanigawa:
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. 3569-3585 - Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov:
On the approximability of the Simplified Partial Digest Problem. 3586-3592 - Adrian Kosowski:
Approximating the maximum 2- and 3-edge-colorable subgraph problems. 3593-3600 - Nicola Apollonio, Ronald I. Becker, Isabella Lari, Federica Ricca, Bruno Simeone:
Bicolored graph partitioning, or: gerrymandering at its worst. 3601-3614 - Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz:
About equivalent interval colorings of weighted graphs. 3615-3624 - Krzysztof Giaro, Marek Kubale, Pawel Obszarski:
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. 3625-3630 - Jacques Carlier, Aziz Moukrim, Huang Xu:
The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm. 3631-3642 - Heinz Gröflin, Andreas Klinkert:
A new neighborhood and tabu search for the Blocking Job Shop. 3643-3655 - J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd:
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. 3656-3664 - Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. 3665-3677
Volume 157, Number 18, November 2009
- Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Wilfried Imrich, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi:
On the remoteness function in median graphs. 3679-3688 - Oded Berman, Jörg Kalcsics, Dmitry Krass, Stefan Nickel:
The Ordered Gradual Covering Location Problem on a Network. 3689-3707 - R. Chandrasekaran, Milind Dawande:
Structural analysis of a fractional matching problem. 3708-3720 - N. S. Narayanaswamy, R. Subashini:
A new characterization of matrices with the consecutive ones property. 3721-3727 - Tian-Jia Ni, Zhi-Ying Wen:
The self-affine property of (U, r)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS. 3728-3742
- Xue-Gang Chen, Wai Chee Shiu:
A note on the domination dot-critical graphs. 3743-3745
- Di Wang, Robert Kleinberg:
Analyzing quadratic unconstrained binary optimization problems via multicommodity flows. 3746-3753
- Hua Wang:
Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence. 3754
a service of 
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-04-19 19:20 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
