Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 161
Volume 161, Numbers 1-2, January 2013
- Julio Aracena, Luis Gómez, Lilian Salinas
:
Limit cycles and update digraphs in Boolean networks. 1-12
- Pentti Haukkanen, Jorma K. Merikoski:
Asymptotics of the number of threshold functions on a two-dimensional rectangular grid. 13-18 - Lisa Hellerstein, Devorah Kletenik:
On the gap between ess(f) and cnf_size(f). 19-27
- Igor Averbakh, Mehmet Baysan:
Batching and delivery in semi-online distribution systems. 28-42 - Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich:
Avoidance of boxed mesh patterns on permutations. 43-51 - Camino Balbuena, Xavier Marcote:
The k-restricted edge-connectivity of a product of graphs. 52-59 - Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos:
On optimal k-fold colorings of webs and antiwebs. 60-70 - Zhongyuan Che, Zhibo Chen:
Forcing faces in plane bipartite graphs (II). 71-80 - Mahdi Cheraghchi:
Noise-resilient group testing: Limitations and constructions. 81-95 - Alberto Costa, Pierre Hansen, Leo Liberti:
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. 96-106 - Éva Czabarka, Péter L. Erdös, Virginia Johnson, Vincent Moulton:
Generating functions for multi-labeled trees. 107-117 - Aiping Deng, Alexander K. Kelmans, Juan Meng:
Laplacian spectra of regular graph transformations. 118-133 - Zhibin Du:
An edge grafting theorem on the Estrada index of graphs and its applications. 134-139 - Petr A. Golovach, Daniël Paulusma, Jian Song:
4-coloring H-free graphs when H is small. 140-150 - Alain Goupil, Hugo Cloutier, Marie-Eve Pellerin:
Generating functions for inscribed polyominoes. 151-166 - Santosh N. Kabadi, Abraham P. Punnen:
Spanning cactus of a graph: Existence, extension, optimization, and approximation. 167-175 - Evangelos Kranakis, Oscar Morales-Ponce, Ladislav Stacho:
Strongly connected orientations of plane graphs. 176-183 - Julien Lesca, Michel Minoux, Patrice Perny:
Compact versus noncompact LP formulations for minimizing convex Choquet integrals. 184-199 - Xiangwen Li, Sanming Zhou:
Labeling outerplanar graphs with maximum degree three. 200-211 - Meili Liang, Bolian Liu:
On the Randić index and girth of graphs. 212-216 - Patrick Niesink, Keven Poulin, Mateja Sajna:
Computing transitive closure of bipolar weighted digraphs. 217-243 - Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski:
On the maximum quasi-clique problem. 244-257 - Guillaume Sagnol:
Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs. 258-276 - Guifu Su, Liming Xiong, Lan Xu:
On the Co-PI and Laplacian Co-PI eigenvalues of a graph. 277-283 - Ismael González Yero, Juan Alberto Rodríguez-Velázquez:
Computing global offensive alliances in Cartesian product graphs. 284-293
- Jordan R. Bell:
Cyclotomic orthomorphisms of finite fields. 294-300 - Ohad N. Feldheim, Rani Hod:
3/2 firefighters are not enough. 301-306 - Yingqian Wang, Lingji Xu:
A sufficient condition for a plane graph with maximum degree 6 to be class 1. 307-310
- Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: A database of interesting graphs. 311-314
- Yves Crama, Peter L. Hammer:
Boolean Functions. 315
Volume 161, Number 3, February 2013
- Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
Faster optimal algorithms for segment minimization with small maximal value. 317-329 - C. N. Campos, Yoshiko Wakabayashi:
On dominating sets of maximal outerplanar graphs. 330-335 - Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Recognition of probe distance-hereditary graphs. 336-348 - Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Relating the annihilation number and the total domination number of a tree. 349-354 - Guoli Ding, Cheng Liu:
Excluding a small minor. 355-368 - Keith J. Edwards:
Harmonious chromatic number of directed graphs. 369-376 - Evgeny Gurevsky, Olga Battaïa, Alexandre Dolgui:
Stability measure for a generalized assembly line balancing problem. 377-394 - Zana Kovijanic Vukicevic, Dragan Stevanovic:
Bicyclic graphs with extremal values of PI index. 395-403 - Jun Yuan, Aixia Liu, Hongmei Wu, Jing Li:
Panconnectivity of n-dimensional torus networks with faulty vertices and edges. 404-423
- Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in long codes. 424-429 - Vladimir Kats, Eugene Levner:
A note on periodic schedules for linear precedence constraints. 430-434 - Jaromy Kuhl:
Transversals and competition numbers of complete multipartite graphs. 435-440 - Lifeng Ou, Heping Zhang:
Fibonacci (p, r)-cubes which are median graphs. 441-444 - Li Shang, Heping Zhang:
Super restricted edge-connectivity of graphs with diameter 2. 445-451
Volume 161, Numbers 4-5, March 2013
- Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries:
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. 453 - Shoshana Anily, Aharona Pfeffer:
The uncapacitated swapping problem on a line and on a circle. 454-465 - Mustapha Aouchiche, Pierre Hansen:
A survey of Nordhaus-Gaddum type relations. 466-546 - Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Optimal solutions for routing problems with profits. 547-557 - Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. 558-572 - Gunnar Brinkmann, Simon Crevals, John Frye:
An independent set approach for the communication network of the GPS III system. 573-579 - Roberto Cordone, Guglielmo Lulli:
An integer optimization approach for reverse engineering of gene regulatory networks. 580-592 - Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmín Á. Ríos-Solís:
Resilience and optimization of identifiable bipartite graphs. 593-603 - Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich:
Randomized algorithms and upper bounds for multiple domination in graphs and networks. 604-611 - Sylvain Gravier, Anne Lacroix, Souad Slimani:
(a, b)-codes in Z/nZ. 612-617 - Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali:
Tight compact models and comparative analysis for the prize collecting Steiner tree problem. 618-632 - Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan:
Finding and listing induced paths and cycles. 633-641 - Antonio J. Lozano, Juan A. Mesa, Frank Plastria:
The ordered anti-median problem with distances derived from a strictly convex norm. 642-649 - Frédéric Maffray, Ana Silva:
b-colouring the Cartesian product of trees and some other graphs. 650-669 - Monaldo Mastrolilli, Arash Rafiey:
On the approximation of minimum cost homomorphism to bipartite graphs. 670-676 - Martin Milanic, Alexandru I. Tomescu:
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. 677-690 - I. M. Monroy, Ciro-Alberto Amaya, André Langevin:
The periodic capacitated arc routing problem with irregular services. 691-701 - Ingo Schiermeyer:
On minimally rainbow k-connected graphs. 702-705
Volume 161, Number 6, April 2013
- Kira V. Adaricheva, James B. Nation, Robert Rand:
Ordered direct implicational basis of a finite closure system. 707-723
- Eric Ould Dadah Andriantiana:
Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence. 724-741 - Mikhail A. Babin, Sergei O. Kuznetsov:
Computing premises of a minimal cover of functional dependencies is intractable. 742-749 - Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
On the approximability and exact algorithms for vector domination and related problems in graphs. 750-767 - Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga:
Moments in graphs. 768-777 - Benjamin Doerr, Anna Huber, Ariel Levavi:
Strong robustness of randomized rumor spreading protocols. 778-793 - Fengming Dong, Weigen Yan, Fuji Zhang:
On the number of perfect matchings of line graphs. 794-801 - Min Feng, Min Xu, Kaishun Wang:
On the metric dimension of line graphs. 802-805 - Shinya Fujita, Michitaka Furuya:
Difference between 2-rainbow domination and Roman domination in graphs. 806-812 - Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós:
Majority and plurality problems. 813-818 - Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
Complexity of trails, paths and circuits in arc-colored digraphs. 819-828 - Ernst J. Joubert:
Maximum sizes of graphs with given restrained domination numbers. 829-837 - Henry Martyn Mulder, Beth Novick:
A tight axiomatization of the median procedure on median graphs. 838-846
- Eric Angel, Romain Campigotto, Christian Laforest:
A new lower bound on the independence number of graphs. 847-852 - Camino Balbuena, Diego González-Moreno, Juan José Montellano-Ballesteros:
A note on the upper bound and girth pair of (k;g)-cages. 853-857 - Byung-Cheon Choi, Jibok Chung:
Job release scheduling problem: Complexity and an approximation algorithm. 858-863 - Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
List distinguishing parameters of trees. 864-869
Volume 161, Numbers 7-8, May 2013
- Peter J. Humphries, Simone Linz, Charles Semple:
On the complexity of computing the temporal hybridization number for two phylogenies. 871-880
- Sarah Spence Adams, Noura Howell, Nathaniel J. Karst, Denise Sakai Troxell, Junjie Zhu:
On the L(2, 1)-labelings of amalgamations of graphs. 881-888 - Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen:
Quasi-hamiltonian paths in semicomplete multipartite digraphs. 889-898 - Cristina Bazgan, Morgan Chopin, Bernard Ries:
The firefighter problem with more than one firefighter on trees. 899-908 - Nadia Brauner, Sylvain Gravier, Louis-Philippe Kronek, Frédéric Meunier:
LAD models, trees, and an analog of the fundamental theorem of arithmetic. 909-920 - Min Chen, André Raspaud:
Planar graphs without 4- and 5-cycles are acyclically 4-choosable. 921-931 - An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao:
A linear-time algorithm for finding an edge-partition with max-min ratio at most two. 932-943 - Italo J. Dejter:
Worst-case efficient dominating sets in digraphs. 944-952 - Tomica Divnic, Ljiljana Pavlovic:
Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index. 953-960 - Peter Eades, Giuseppe Liotta:
Right angle crossing graphs and 1-planarity. 961-969 - Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Corner cuts are close to optimal: From solid grids to polygons and back. 970-998 - Ze-Tu Gao, Jian-Hua Yin:
On the t-pebbling number and the 2t-pebbling property of graphs. 999-1005 - Marc Hellmuth:
On the complexity of recognizing S-composite and S-prime graphs. 1006-1013 - Mokhtar H. Konsowa, Fahimah Al-Awadhi, András Telcs:
Commute times of random walks on trees. 1014-1021 - Dorota Kuziak, Ismael González Yero, Juan Alberto Rodríguez-Velázquez:
On the strong metric dimension of corona product graphs and join graphs. 1022-1027 - Van Bang Le, Dieter Rautenbach:
Integral mixed unit interval graphs. 1028-1036 - Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Normal Helly circular-arc graphs and its subclasses. 1037-1059 - Wu-Hsiung Lin, Gerard J. Chang:
b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture. 1060-1066 - Yo-Lin Lin, Justie Su-tzu Juan, Yue-Li Wang:
Finding the edge ranking number through vertex partitions. 1067-1071 - Carles Padró, Leonor Vázquez, An Yang:
Finding lower bounds on the complexity of secret sharing schemes by linear programming. 1072-1084 - B. S. Panda, Subhabrata Paul:
Liar's domination in graphs: Complexity and algorithm. 1085-1092 - Jung-Heum Park, Insung Ihm:
Strong matching preclusion under the conditional fault model. 1093-1105 - Adrien Richard, Paul Ruet:
From kernels in directed graphs to fixed points and negative cycles in Boolean networks. 1106-1117 - Jian-Hua Yin:
An extension of A.R. Rao's characterization of potentially Km+1-graphic sequences. 1118-1127 - Carol T. Zamfirescu:
(2)-pancyclic graphs. 1128-1136
- Frantisek Galcík, Ján Katrenic:
A note on approximating the b-chromatic number. 1137-1140 - Sugata Gangopadhyay:
Affine inequivalence of cubic Maiorana-McFarland type bent functions. 1141-1146 - Bill Jackson, Tibor Jordán, Csaba Király:
Strongly rigid tensegrity graphs on the line. 1147-1149 - Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Wiener index versus Szeged index in networks. 1150-1153 - Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan:
Towards optimal kernel for connected vertex cover in planar graphs. 1154-1161 - Mostafa Tavakoli, Freydoon Rahbarnia, A. R. Ashrafi:
Further results on hierarchical product of graphs. 1162-1167
Volume 161, Number 9, June 2013
- Daniel J. Kleitman, Aditya Shastri, Vera T. Sós:
Editorial. 1169 - Mukti Acharya, Deepa Sinha:
Characterization of signed line digraphs. 1170-1172 - Rangaswami Balakrishnan, S. Francis Raj:
Bounds for the b-chromatic number of G-v. 1173-1179 - Amitava Bhattacharya, Navin M. Singhi:
Some approaches for solving the general (t, k)-design existence problem and other related problems. 1180-1186 - T. Tamizh Chelvam, Sivagnanam Mutharasu:
Subgroups as efficient dominating sets in Cayley graphs. 1187-1190 - David Conlon, Jacob Fox, Benny Sudakov:
An improved bound for the stepping-up lemma. 1191-1196 - Andrzej Dudek, Peter Frankl, Vojtech Rödl:
Some recent results on Ramsey-type numbers. 1197-1202 - Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in the covering graph of the cube. 1203-1208 - Subir Kumar Ghosh, Penny E. Haxell:
Packing and covering tetrahedra. 1209-1215 - Shan-Yuan Ho, Daniel J. Kleitman:
An odd kind of BCH code. 1216-1220 - Glenn Hurlbert:
General graph pebbling. 1221-1231 - Oliver Johnson, Ioannis Kontoyiannis, Mokshay M. Madiman:
Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures. 1232-1250 - Gyula O. H. Katona:
Sperner type theorems with excluded subposets. 1251-1258 - János Pach, Géza Tóth:
Monochromatic empty triangles in two-colored point sets. 1259-1261 - Deepa Sinha, Jaspreet Kaur:
Full friendly index set - I. 1262-1274 - Deepa Sinha, Somya Upadhyaya, Priya Kataria:
Characterization of common-edge sigraph. 1275-1285
Volume 161, Numbers 10-11, July 2013
- Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Simple agents learn to find their way: An introduction on mapping polygons. 1287-1307
- Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall:
Domination game: Extremal families of graphs for 3/53/5-conjectures. 1308-1316 - Oliver Friedmann:
A superpolynomial lower bound for strategy iteration based on snare memorization. 1317-1337 - Lucy Small, Oliver Mason:
Information diffusion on the iterated local transitivity model of online social networks. 1338-1344
- Julio Aracena, Jacques Demongeot, Eric Fanchon, Marco Montalva:
On the number of update digraphs and its relation with the feedback arc sets and tournaments. 1345-1355