Journal: Discrete Applied Mathematics

Volume 161, Issue 9

1169 -- 0Daniel J. Kleitman, Aditya Shastri, Vera T. Sós. Editorial
1170 -- 1172Mukti Acharya, Deepa Sinha. Characterization of signed line digraphs
1173 -- 1179Rangaswami Balakrishnan, S. Francis Raj. v
1180 -- 1186Amitava Bhattacharya, Navin M. Singhi. k)-design existence problem and other related problems
1187 -- 1190T. Tamizh Chelvam, Sivagnanam Mutharasu. Subgroups as efficient dominating sets in Cayley graphs
1191 -- 1196David Conlon, Jacob Fox, Benny Sudakov. An improved bound for the stepping-up lemma
1197 -- 1202Andrzej Dudek, Peter Frankl, Vojtech Rödl. Some recent results on Ramsey-type numbers
1203 -- 1208Dwight Duffus, Peter Frankl, Vojtech Rödl. Maximal independent sets in the covering graph of the cube
1209 -- 1215Subir Kumar Ghosh, Penny E. Haxell. Packing and covering tetrahedra
1216 -- 1220Shan-Yuan Ho, Daniel J. Kleitman. An odd kind of BCH code
1221 -- 1231Glenn Hurlbert. General graph pebbling
1232 -- 1250Oliver Johnson, Ioannis Kontoyiannis, Mokshay M. Madiman. Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures
1251 -- 1258Gyula O. H. Katona. Sperner type theorems with excluded subposets
1259 -- 1261János Pach, Géza Tóth. Monochromatic empty triangles in two-colored point sets
1262 -- 1274Deepa Sinha, Jaspreet Kaur. Full friendly index set - I
1275 -- 1285Deepa Sinha, Somya Upadhyaya, Priya Kataria. Characterization of common-edge sigraph

Volume 161, Issue 7-8

871 -- 880Peter J. Humphries, Simone Linz, Charles Semple. On the complexity of computing the temporal hybridization number for two phylogenies
881 -- 888Sarah Spence Adams, Noura Howell, Nathaniel Karst, Denise Sakai Troxell, JunJie Zhu. L(2, 1)-labelings of amalgamations of graphs
889 -- 898Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen. Quasi-hamiltonian paths in semicomplete multipartite digraphs
899 -- 908Cristina Bazgan, Morgan Chopin, Bernard Ries. The firefighter problem with more than one firefighter on trees
909 -- 920Nadia Brauner, Sylvain Gravier, Louis-Philippe Kronek, Frédéric Meunier. LAD models, trees, and an analog of the fundamental theorem of arithmetic
921 -- 931Min Chen, André Raspaud. Planar graphs without 4- and 5-cycles are acyclically 4-choosable
932 -- 943An-Chiang Chu, Bang Ye Wu, Kun-Mao Chao. A linear-time algorithm for finding an edge-partition with max-min ratio at most two
944 -- 952Italo J. Dejter. Worst-case efficient dominating sets in digraphs
953 -- 960Tomica Divnic, Ljiljana Pavlovic. Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
961 -- 969Peter Eades, Giuseppe Liotta. Right angle crossing graphs and 1-planarity
970 -- 998Andreas Emil Feldmann, Shantanu Das 0001, Peter Widmayer. Corner cuts are close to optimal: From solid grids to polygons and back
999 -- 1005Ze-Tu Gao, Jian-Hua Yin. t-pebbling property of graphs
1006 -- 1013Marc Hellmuth. On the complexity of recognizing S-composite and S-prime graphs
1014 -- 1021Mokhtar H. Konsowa, Fahimah Al-Awadhi, András Telcs. Commute times of random walks on trees
1022 -- 1027Dorota Kuziak, Ismael González Yero, Juan Alberto Rodríguez-Velazquez. On the strong metric dimension of corona product graphs and join graphs
1028 -- 1036Van Bang Le, Dieter Rautenbach. Integral mixed unit interval graphs
1037 -- 1059Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter. Normal Helly circular-arc graphs and its subclasses
1060 -- 1066Wu-Hsiung Lin, Gerard J. Chang. b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
1067 -- 1071Yo-Lin Lin, Justie Su-tzu Juan, Yue-Li Wang. Finding the edge ranking number through vertex partitions
1072 -- 1084Carles Padró, Leonor Vázquez, an Yang. Finding lower bounds on the complexity of secret sharing schemes by linear programming
1085 -- 1092B. S. Panda, S. Paul. Liar's domination in graphs: Complexity and algorithm
1093 -- 1105Jung-Heum Park, Insung Ihm. Strong matching preclusion under the conditional fault model
1106 -- 1117Adrien Richard, Paul Ruet. From kernels in directed graphs to fixed points and negative cycles in Boolean networks
1118 -- 1127Jian-Hua Yin. m+1-graphic sequences
1128 -- 1136Carol T. Zamfirescu. (2)-pancyclic graphs
1137 -- 1140Frantisek Galcík, Ján Katrenic. b-chromatic number
1141 -- 1146Sugata Gangopadhyay. Affine inequivalence of cubic Maiorana-McFarland type bent functions
1147 -- 1149Bill Jackson, Tibor Jordán, Csaba Király. Strongly rigid tensegrity graphs on the line
1150 -- 1153Sandi Klavzar, M. J. Nadjafi-Arani. Wiener index versus Szeged index in networks
1154 -- 1161Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan. Towards optimal kernel for connected vertex cover in planar graphs
1162 -- 1167M. Tavakoli, F. Rahbarnia, A. R. Ashrafi. Further results on hierarchical product of graphs

Volume 161, Issue 6

707 -- 723Kira V. Adaricheva, James B. Nation, Robert Rand. Ordered direct implicational basis of a finite closure system
724 -- 741Eric Ould Dadah Andriantiana. Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence
742 -- 749Mikhail A. Babin, Sergei O. Kuznetsov. Computing premises of a minimal cover of functional dependencies is intractable
750 -- 767Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro. On the approximability and exact algorithms for vector domination and related problems in graphs
768 -- 777Cristina Dalfó, Miguel Angel Fiol, Ernest Garriga. Moments in graphs
778 -- 793Benjamin Doerr, Anna Huber, Ariel Levavi. Strong robustness of randomized rumor spreading protocols
794 -- 801Fengming Dong, Weigen Yan, Fuji Zhang. On the number of perfect matchings of line graphs
802 -- 805Min Feng, Min Xu, Kaishun Wang. On the metric dimension of line graphs
806 -- 812Shinya Fujita, Michitaka Furuya. Difference between 2-rainbow domination and Roman domination in graphs
813 -- 818Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós. Majority and plurality problems
819 -- 828Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot. Complexity of trails, paths and circuits in arc-colored digraphs
829 -- 837Ernst J. Joubert. Maximum sizes of graphs with given restrained domination numbers
838 -- 846Henry Martyn Mulder, Beth Novick. A tight axiomatization of the median procedure on median graphs
847 -- 852Eric Angel, Romain Campigotto, Christian Laforest. A new lower bound on the independence number of graphs
853 -- 857Camino Balbuena, Diego González-Moreno, Juan José Montellano-Ballesteros. g)-cages
858 -- 863Byung-Cheon Choi, Jibok Chung. Job release scheduling problem: Complexity and an approximation algorithm
864 -- 869Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger. List distinguishing parameters of trees

Volume 161, Issue 4-5

453 -- 0Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries. GO VII Meeting, Ovronnaz (CH), June 13-17, 2010
454 -- 465Shoshana Anily, Aharona Pfeffer. The uncapacitated swapping problem on a line and on a circle
466 -- 546Mustapha Aouchiche, Pierre Hansen. A survey of Nordhaus-Gaddum type relations
547 -- 557Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza. Optimal solutions for routing problems with profits
558 -- 572Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos. Fast algorithms for min independent dominating set
573 -- 579Gunnar Brinkmann, Simon Crevals, John Frye. An independent set approach for the communication network of the GPS III system
580 -- 592Roberto Cordone, Guglielmo Lulli. An integer optimization approach for reverse engineering of gene regulatory networks
593 -- 603Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmin A. Rios-Solis. Resilience and optimization of identifiable bipartite graphs
604 -- 611Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich. Randomized algorithms and upper bounds for multiple domination in graphs and networks
612 -- 617Sylvain Gravier, Anne Lacroix, Souad Slimani. Z
618 -- 632Mohamed Haouari, Safa Bhar Layeb, Hanif D. Sherali. Tight compact models and comparative analysis for the prize collecting Steiner tree problem
633 -- 641Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan. Finding and listing induced paths and cycles
642 -- 649Antonio J. Lozano, Juan A. Mesa, Frank Plastria. The ordered anti-median problem with distances derived from a strictly convex norm
650 -- 669Frédéric Maffray, Ana Silva. b-colouring the Cartesian product of trees and some other graphs
670 -- 676Monaldo Mastrolilli, Arash Rafiey. On the approximation of minimum cost homomorphism to bipartite graphs
677 -- 690Martin Milanic, Alexandru I. Tomescu. Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
691 -- 701I. M. Monroy, Ciro-Alberto Amaya, André Langevin. The periodic capacitated arc routing problem with irregular services
702 -- 705Ingo Schiermeyer. k-connected graphs

Volume 161, Issue 3

317 -- 329Therese C. Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young. Faster optimal algorithms for segment minimization with small maximal value
330 -- 335C. N. Campos, Yoshiko Wakabayashi. On dominating sets of maximal outerplanar graphs
336 -- 348Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith. Recognition of probe distance-hereditary graphs
349 -- 354Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning. Relating the annihilation number and the total domination number of a tree
355 -- 368Guoli Ding, Cheng Liu. Excluding a small minor
369 -- 376Keith J. Edwards. Harmonious chromatic number of directed graphs
377 -- 394Evgeny Gurevsky, Olga Battaïa, Alexandre Dolgui. Stability measure for a generalized assembly line balancing problem
395 -- 403Zana Kovijanic Vukicevic, Dragan Stevanovic. Bicyclic graphs with extremal values of PI index
404 -- 423Jun Yuan, Aixia Liu, Hongmei Wu, Jing Li. Panconnectivity of n-dimensional torus networks with faulty vertices and edges
424 -- 429Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen. The maximum number of minimal codewords in long codes
430 -- 434Vladimir Kats, Eugene Levner. A note on periodic schedules for linear precedence constraints
435 -- 440Jaromy Kuhl. Transversals and competition numbers of complete multipartite graphs
441 -- 444Lifeng Ou, Heping Zhang. Fibonacci (p, r)-cubes which are median graphs
445 -- 451Li Shang, Heping Zhang. Super restricted edge-connectivity of graphs with diameter 2

Volume 161, Issue 18

2795 -- 2801E. Abajo, R. M. Casablanca, Ana Diánez, Pedro García-Vázquez. On average connectivity of the strong product of graphs
2802 -- 2811Patrick Ali, Simon Mukwembi, S. Munyira. Degree distance and vertex-connectivity
2812 -- 2826Miguel F. Anjos, Manuel V. C. Vieira. Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
2827 -- 2840Mahdieh Azari, Ali Iranmanesh. Computing the eccentric-distance sum for graph operations
2841 -- 2850Cristina Bazgan, Florian Jamain, Daniel Vanderpooten. On the number of non-dominated points of a multicriteria optimization problem
2851 -- 2861Francine Blanchet-Sadri, Sean Simmons. Counting minimal semi-Sturmian words
2862 -- 2875Nils Boysen, Konrad Stephan. The deterministic product location problem under a pick-by-order policy
2876 -- 2884Roman Cada, Jan Ekstein, Premysl Holub, Olivier Togni. Radio labelings of distance graphs
2885 -- 2893Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae. [1, 2]-sets in graphs
2894 -- 2900Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng. Cycles embedding on folded hypercubes with faulty nodes
2901 -- 2909Alberto Costa. Valid constraints for the Point Packing in a Square problem
2910 -- 2924Ari Cukierman, Gexin Yu. New bounds on the minimum density of an identifying code for the infinite hexagonal grid
2925 -- 2931Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning. Bounds on the connected domination number of a graph
2932 -- 2936Ewa Drgas-Burchardt, Zbigniew Switalski. A number of stable matchings in models of the Gale-Shapley type
2937 -- 2945Fang-Wei Fu, San Ling, Chaoping Xing. New results on two hypercube coloring problems
2946 -- 2951Daniel Gonçalves, Aline Parreau, Alexandre Pinlou. Locally identifying coloring in bounded expansion classes of graphs
2952 -- 2957Elizabeth Hartung. Fullerenes with complete Clar structure
2958 -- 2967Jianfeng Hou, Weitao Wang, Xiaoran Zhang. Acyclic edge coloring of planar graphs with girth at least 5
2968 -- 2984Markus Kuba, Hosam M. Mahmoud, Alois Panholzer. Analysis of a generalized Friedman's urn with multiple drawings
2985 -- 2991Hongyu Liang. On the k-edge-incident subgraph problem and its variants
2992 -- 3004Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Tzu-Liang Kung. Disjoint cycles in hypercubes with prescribed vertices in each cycle
3005 -- 3016S. C. López, Francesc A. Muntaner-Batle, Miquel Rius-Font. Labeling constructions using digraph products
3017 -- 3027Anh Ninh, András Prékopa. Log-concavity of compound distributions with applications in stochastic optimization
3028 -- 3047Offer Shai, Adnan Sljoka, Walter Whiteley. Directed graphs, decompositions, and spatial linkages
3048 -- 3053Ruixia Wang, Shiying Wang. k-optimal
3054 -- 3062Shiying Wang, Kai-Feng, Guozhen Zhang. Strong matching preclusion for k-ary n-cubes
3063 -- 3071Weizhong Wang, Dong Yang, Yanfeng Luo. The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
3072 -- 3079Krasimir Yordzhev. On the number of disjoint pairs of S-permutation matrices
3080 -- 3086Louis J. Billera, Saúl A. Blanco. Bandwidth of the product of paths of the same length
3087 -- 3089Nader Jafari Rad, Lutz Volkmann. A note on the independent domination number in graphs
3090 -- 3096Wojciech Kazmierczak. The best choice problem for a union of two linear orders with common maximum
3097 -- 3099Shin-ichi Tokunaga. Dominating sets of maximal outerplanar graphs
3100 -- 3103Zhifu You, Lihua You, Wenxi Hong. Comment on "Kirchhoff index in line, subdivision and total graphs of a regular graph"
3104 -- 3108Yuyin Yu, Mingsheng Wang. Permutation polynomials and their differential properties over residue class rings

Volume 161, Issue 16-17

2349 -- 2360Bernardetta Addis, Marco Di Summa, Andrea Grosso. Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth
2361 -- 2366Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono. Optimal approximability of bookmark assignments
2367 -- 2379Teodor Banica, Ion Nechita. Almost Hadamard matrices: The case of arbitrary exponents
2380 -- 2388Flavia Bonomo, Mitre Costa Dourado, Guillermo Durán, Luerbio Faria, Luciano N. Grippo, Martín Darío Safe. Forbidden subgraphs and the König-Egerváry property
2389 -- 2395Michael Brand. Friedman numbers have density 1
2396 -- 2404Kejun Chen, Guangzhou Chen, Wen Li, Ruizhong Wei. Super-simple balanced incomplete block designs with block size 5 and index 3
2405 -- 2409Gek L. Chia, Kai An Sim. On the skewness of the join of graphs
2410 -- 2419Vitor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach. More fires and more fighters
2420 -- 2426Michitaka Furuya. Upper bounds on the diameter of domination dot-critical graphs with given connectivity
2427 -- 2439Xianya Geng, Shuchao Li, Meng Zhang. Extremal values on the eccentric distance sum of trees
2440 -- 2459Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas. Patience of matrix games
2460 -- 2466Michael A. Henning, Nader Jafari Rad. Bounds on neighborhood total domination in graphs
2467 -- 2479Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov. On strong edge-colouring of subcubic graphs
2480 -- 2491Hongbo Hua, Kinkar Ch. Das. The relationship between the eccentric connectivity index and Zagreb indices
2492 -- 2498W. Sean Kennedy, Andrew D. King. Finding a smallest odd hole in a claw-free graph using global structure
2499 -- 2513George Kettleborough, Victor J. Rayward-Smith. Optimising sum-of-squares measures for clustering multisets defined over a metric space
2514 -- 2526Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson. Restricted non-separable planar maps and some pattern avoiding permutations
2527 -- 2531Xueliang Li, Mengmeng Liu. Bicyclic graphs with maximal revised Szeged index
2532 -- 2536Wu-Hsiung Lin, Gerard J. Chang. bb-chromatic numbers of powers of paths and cycles
2537 -- 2543Huiqiu Lin, Jinlong Shu. The distance spectral radius of digraphs
2544 -- 2548Jianxi Liu. On a conjecture of the Randić index and the minimum degree of graphs
2549 -- 2555Henry Liu, Angela Mestre, Teresa Sousa. k-connection in graphs
2556 -- 2562Jens Maßberg. Online binary minimax trees
2563 -- 2586Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta. How many attackers can selfish defenders catch?
2587 -- 2596David Peleg, Ignasi Sau, Mordechai Shalom. d-girth of a graph
2597 -- 2603Mikko Pelto. Optimal (r, ≤3)-locating-dominating codes in the infinite king grid
2604 -- 2623Frank Plastria, José Gordillo, Emilio Carrizosa. Locating a semi-obnoxious covering facility with repelling polygonal regions
2624 -- 2646Justo Puerto, A. B. Ramos, Antonio M. Rodríguez-Chía. A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems
2647 -- 2652Oliver Schaudt. On dominating sets whose induced subgraphs have a bounded diameter
2653 -- 2661Apurv Tiwari, Amitabha Tripathi. On the range of size of sum graphs & integral sum graphs of a given order
2662 -- 2677Jean-Luc Toutant, Eric Andres, Tristan Roussillon. Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties
2678 -- 2686Damir Vukicevic, Gilles Caporossi. Network descriptors based on betweenness centrality and transmission and their extremal values
2687 -- 2694Yiqiao Wang 0002, Qiaojun Shu, Weifan Wang. The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
2695 -- 2701Iwona Wloch, Urszula Bednarz, Dorota Bród, Andrzej Wloch, Malgorzata Wolowiec-Musial. On a new type of distance Fibonacci numbers
2702 -- 2715Yujun Yang, Douglas J. Klein. A recursion formula for resistance distances and its applications
2716 -- 2723Manouchehr Zaker. Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
2724 -- 2730Jørgen Bang-Jensen, Sven Simonsen. Arc-disjoint paths and trees in 2-regular digraphs
2731 -- 2739Monica Bianchi, Alessandra Cornaro, Anna Torriero. A majorization method for localizing graph topological indices
2740 -- 2744Hanyuan Deng, S. Balachandran, S. K. Ayyaswamy, Y. B. Venkatakrishnan. On the harmonic index and the chromatic number of a graph
2745 -- 2748Jong Yoon Hyun, Heisook Lee, Yoonjin Lee. Nonexistence of certain types of plateaued functions
2749 -- 2752Hongwei Li, Shengjia Li, Yubao Guo, Michel Surmacs. On the vertex-pancyclicity of hypertournaments
2753 -- 2757Hao Li, Weihua Yang. mm vertices and extra edge-connectivity of hypercubes
2758 -- 2763Jakub Przybylo. On upper bounds for multiple domination numbers of graphs
2764 -- 2771Julien Roland, Yves De Smet, José Rui Figueira. Inverse multi-objective combinatorial optimization
2772 -- 2777Ian M. Wanless, Xiande Zhang. On the existence of retransmission permutation arrays
2778 -- 2793Pietro Belotti, Julio C. Góez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky. On families of quadratic surfaces having fixed intersections with two hyperplanes

Volume 161, Issue 15

2223 -- 0Isabelle Debled-Rennesson, Eric Domenjoud, Bertrand Kerautret, Philippe Even. Discrete Geometry for Computer Imagery
2224 -- 2235Péter Balázs. Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
2236 -- 2251Kees Joost Batenburg, Wagner Fortes, Lajos Hajdu, Robert Tijdeman. Bounds on the quality of reconstructed images in binary tomography
2252 -- 2268Etienne Baudrier, Mohamed Tajine, Alain Daurat. Polygonal estimation of planar convex-set perimeter from its two projections
2269 -- 2280Jürgen Bokowski, Ernesto Staffetti. Checking oriented matroid isomorphism by means of canonical labeling
2281 -- 2292Sara Brunetti, Paolo Dulio, Carla Peri. Discrete tomography determination of bounded lattice sets from four X-rays
2293 -- 2315Jacques-Olivier Lachaud, Mouhammad Said. Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
2316 -- 2327Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon. On the shape of permutomino tiles
2328 -- 2335K. G. Subramanian, Ibrahim Venkat, Erzsébet Csuhaj-Varjú. On the power of permitting features in cooperating context-free array grammar systems
2336 -- 2347Peter Veelaert. Topological relations between separating circles

Volume 161, Issue 13-14

1789 -- 1804Daniele Catanzaro, Martine Labbé, Raffaele Pesenti. The balanced minimum evolution problem under uncertain data
1805 -- 1817Daniel M. Martin, Bhalchandra D. Thatte. The maximum agreement subtree problem
1818 -- 1827Adam Kozak, Tomasz Glowacki, Piotr Formanowicz. On a generalized model of labeled graphs
1828 -- 1836Daniel W. Cranston, William B. Kinnersley, Suil O, Douglas B. West. Game matching number of graphs
1837 -- 1842Vladimir G. Deineko, Gerhard J. Woeginger. Two hardness results for core stability in hedonic coalition formation games
1843 -- 1858Leah Epstein, Michal Feldman, Tami Tamir, Lukasz Witkowski, Marcin Witkowski. Approximate strong equilibria in job scheduling games with two uniformly related machines
1859 -- 1867S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza. Equality of domination and transversal numbers in hypergraphs
1868 -- 1881Peter R. J. Asveld. Permuting operations on strings and the distribution of their prime numbers
1882 -- 1887Alan F. Beardon. Resolving the hypercube
1888 -- 1893Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos. Characterizing graphs of small carving-width
1894 -- 1911Radim Belohlávek, Vilém Vychodil. Closure-based constraints in formal concept analysis
1912 -- 1924Asen Bojilov, Yair Caro, Adriana Hansberg, Nedyalko Nenov. Partitions of graphs into small and large sets
1925 -- 1942Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler. On minimal forbidden subgraph characterizations of balanced graphs
1943 -- 1949Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko. kk-path cover
1950 -- 1958Dariusz Dereniowski, Öznur Yasar Diner, Danny Dyer. Three-fast-searchable graphs
1959 -- 1974Paolo Dulio, Carla Peri. Discrete tomography for inscribable lattice sets
1975 -- 1987Leah Epstein, Csanád Imreh, Asaf Levin. Bin covering with cardinality constraints
1988 -- 2000Anna Galluccio, Claudio Gentile, Paolo Ventura. 22-clique-bond of stable set polyhedra
2001 -- 2007M. Ghebleh, Ludovít Niepel. Locating and identifying codes in circulant networks
2008 -- 2013Steffen Grüter, Yubao Guo, Andreas Holtkamp. Restricted arc-connectivity of bipartite tournaments
2014 -- 2024Michael A. Henning, Ernst J. Joubert. Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
2025 -- 2037Florian Jaehn, Erwin Pesch. New bounds and constraint propagation techniques for the clique partitioning problem
2038 -- 2041Hai-Tao Jin, Lisa H. Sun. On Spieß's conjecture on harmonic numbers
2042 -- 2051Ville Junnila. New lower bound for 2-identifying code in the square grid
2052 -- 2061Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski. L(2, 1)L(2, 1)-span in polynomial space
2062 -- 2074Changhong Lu, Qing Zhou. L(2, 1)L(2, 1)-labeling number of graphs
2075 -- 2078Hongliang Lu. b][a, b]-factors
2079 -- 2083Benjian Lv, Kaishun Wang. qq-Kneser graphs
2084 -- 2094Toufik Mansour, Mark Shattuck. A combinatorial approach to a general two-term recurrence
2095 -- 2100Jana Maxová, Daniel Turzík. Which distance-hereditary graphs are cover-incomparability graphs?
2101 -- 2106Zeev Nutov. kk-connected graphs
2107 -- 2119Damien Prot, Christophe Rapine. Approximations for the Two-Machine Cross-Docking Flow Shop Problem
2120 -- 2132Amites Sarkar, Martin Haenggi. Percolation in the secrecy graph
2133 -- 2141Tadeja Kraner Sumenjak, Douglas F. Rall, Aleksandra Tepeh. Rainbow domination in the lexicographic product of graphs
2142 -- 2157Anke van Zuylen. Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
2158 -- 2168Aleksander Vesel. Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
2169 -- 2177Lutz Volkmann. Complementary cycles in almost regular multipartite tournaments, where one cycle has length four
2178 -- 2188Yue-Li Wang, Kuo-Hua Wu. A tight upper bound for 2-rainbow domination in generalized Petersen graphs
2189 -- 2195Shou-Jun Xu, Xianyue Li, Ronghua Liang. Moplex orderings generated by the LexDFS algorithm
2196 -- 2199Dong Ye. On the anti-Kekulé number and odd cycle transversal of regular graphs
2200 -- 2204Guillaume Ducoffe . Hamiltonicity of large generalized de Bruijn cycles
2205 -- 2206K. Kianfar, G. Moslehi. A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date"
2207 -- 2212Seog-Jin Kim, Sang June Lee, Won-Jin Park. Dynamic coloring and list dynamic coloring of planar graphs
2213 -- 2216Toufik Mansour, Mark Shattuck. Counting humps and peaks in generalized Motzkin paths
2217 -- 2222Simon Mukwembi. On spanning cycles, paths and trees

Volume 161, Issue 12

1673 -- 0Ulrich Faigle, Rainer Schrader. 9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)
1674 -- 1685David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein. Watching systems in graphs: An extension of identifying codes
1686 -- 1698Daniel Binkele-Raible, Henning Fernau. Packing paths: Recycling saves time
1699 -- 1706Matthijs Bomhoff, Bodo Manthey. Bisimplicial edges in bipartite graphs
1707 -- 1718Valentina Cacchiani, Alberto Caprara, Paolo Toth. A Lagrangian heuristic for a train-unit assignment problem
1719 -- 1725Tiziana Calamoneri, Blerina Sinaimeri. L(2, 1)L(2, 1)-labeling of oriented planar graphs
1726 -- 1733Rija Erves, Janez Zerovnik. Mixed fault diameter of Cartesian graph bundles
1734 -- 1738Frank Göring, Jochen Harant. Prescribed edges and forbidden edges for a cycle in a planar graph
1739 -- 1746Ararat Harutyunyan. Some bounds on global alliances in trees
1747 -- 1754Shahadat Hossain, Trond Steihaug. Graph models and their efficient implementation for sparse Jacobian matrix determination
1755 -- 1760Suh-Ryung Kim, Boram Park, Yoshio Sano. The competition number of the complement of a cycle
1761 -- 1768Bodo Manthey, Kai Plociennik. Approximating independent set in perturbed graphs
1769 -- 1775Jens Maßberg, Tim Nieberg. Rectilinear paths with minimum segment lengths
1776 -- 1783B. S. Panda, D. Pradhan. A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
1784 -- 1787Ingo Schiermeyer. Rainbow connection and minimum degree

Volume 161, Issue 10-11

1287 -- 1307Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Matús Mihalák, Peter Widmayer. Simple agents learn to find their way: An introduction on mapping polygons
1308 -- 1316Bostjan Bresar, Sandi Klavzar, Gasper Kosmrlj, Douglas F. Rall. Domination game: Extremal families of graphs for 3/53/5-conjectures
1317 -- 1337Oliver Friedmann. A superpolynomial lower bound for strategy iteration based on snare memorization
1338 -- 1344Lucy Small, Oliver Mason. Information diffusion on the iterated local transitivity model of online social networks
1345 -- 1355Julio Aracena, Jacques Demongeot, Eric Fanchon, Marco Montalva. On the number of update digraphs and its relation with the feedback arc sets and tournaments
1356 -- 1362Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter, S. Yamaguchi. On the contour of graphs
1363 -- 1366Maria Axenovich, Marcus Krug, Georg Osang, Ignaz Rutter. Fork-forests in bi-colored complete bipartite graphs
1367 -- 1377Yuehua Bu, Kai Lu. List injective coloring of planar graphs with girth 5, 6, 8
1378 -- 1394Jonathan Burns, Egor Dolzhenko, Natasa Jonoska, Tilahun Muche, Masahico Saito. Four-regular graphs with rigid vertices associated to DNA recombination
1395 -- 1401Gerard J. Chang, Bo-Jr Li, Jiaojiao Wu. Rainbow domination and related problems on strongly chordal graphs
1402 -- 1408Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o. Antibandwidth and cyclic antibandwidth of Hamming graphs
1409 -- 1420Andreas W. M. Dress, Vincent Moulton, Andreas Spillner 0001, Taoyang Wu. Obtaining splits from cut sets of tight spans
1421 -- 1426Tomás Feder, Carlos S. Subi. On hypercube labellings and antipodal monochromatic paths
1427 -- 1439Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. Edge contraction and edge removal on iterated clique graphs
1440 -- 1447Delia Garijo, Antonio González Herrera, Alberto Márquez. On the metric dimension, the upper dimension and the resolving number of graphs
1448 -- 1466Simona Grusea, Anthony Labarre. The distribution of cycles in breakpoint graphs of signed permutations
1467 -- 1471Steffen Grüter, Yubao Guo, Andreas Holtkamp, Eduard Ulmer. Restricted arc-connectivity in tournaments
1472 -- 1480Adriana Hansberg, Ryan Pepper. jj-independence in graphs
1481 -- 1489Xiaolan Hu, Huiqing Liu. The (conditional) matching preclusion for burnt pancake graphs
1490 -- 1495Vinayak Joshi, B. N. Waphare, H. Y. Pourali. On generalized zero divisor graph of a poset
1496 -- 1505Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy. Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
1506 -- 1512Jakub Kovác. Complexity of the path avoiding forbidden pairs problem revisited
1513 -- 1520James K. Lan, Gerard Jennhwa Chang. kk-domination problem in graphs
1521 -- 1529Timothy D. LeSaulnier, Douglas B. West. Acquisition-extremal graphs
1530 -- 1537MingChu Li. Hamiltonian claw-free graphs involving minimum degrees
1538 -- 1545Martin Milanic, Oliver Schaudt. Computing square roots of trivially perfect and threshold graphs
1546 -- 1555Esther Mohr, Günter Schmidt. How much is it worth to know the future in online conversion problems?
1556 -- 1575Atsuyoshi Nakamura, Tomoya Saito, Ichigaku Takigawa, Mineichi Kudo, Hiroshi Mamitsuka. Fast algorithms for finding a minimum repetition representation of strings and trees
1576 -- 1585Micha A. Perles, Horst Martini, Yaakov S. Kupitz. On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane
1586 -- 1597Alain Quilliot, Philippe Chrétienne. Homogeneously non-idling schedules of unit-time jobs on identical parallel machines
1598 -- 1609Pascal Schweitzer. Iterated open neighborhood graphs and generalizations
1610 -- 1617Jianfeng Wang, Francesco Belardo. Signless Laplacian eigenvalues and circumference of graphs
1618 -- 1625Ismael González Yero, Juan Alberto Rodríguez-Velazquez, Sergio Bermudo. Alliance free sets in Cartesian product graphs
1626 -- 1631Yong Gao, Donovan R. Hare, James Nastos. The parametric complexity of graph diameter augmentation
1632 -- 1634Stefan Gyürki, Ján Mazák. An efficient algorithm for testing goal-minimality of graphs
1635 -- 1638Vadim E. Levit, Eugen Mandrescu. On maximum matchings in König-Egerváry graphs
1639 -- 1645S. C. López. Small cutsets in arc-transitive digraphs of prime degree
1646 -- 1650Robert C. Powers, Jeremy M. White. Injectivity and weak ternary separation
1651 -- 1654Le Anh Vinh. t)(3, t)-existentially closed graphs
1655 -- 1659Wei Wang, Zhidan Yan. Connectivity of Kronecker products with complete multipartite graphs
1660 -- 1668Yan Wang, Chunxiang Wang. tγt-critical graphs of diameter two
1669 -- 1672László Major. ff-vectors for cyclic and ordinary polytopes

Volume 161, Issue 1-2

1 -- 12Julio Aracena, Luis Gómez, Lilian Salinas. Limit cycles and update digraphs in Boolean networks
13 -- 18Pentti Haukkanen, Jorma K. Merikoski. Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
19 -- 27Lisa Hellerstein, Devorah Kletenik. On the gap between ess(f) and cnf_size(f)
28 -- 42Igor Averbakh, Mehmet Baysan. Batching and delivery in semi-online distribution systems
43 -- 51Sergey V. Avgustinovich, Sergey Kitaev, Alexandr Valyuzhenich. Avoidance of boxed mesh patterns on permutations
52 -- 59Camino Balbuena, Xavier Marcote. The k-restricted edge-connectivity of a product of graphs
60 -- 70Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio C. Santos. On optimal k-fold colorings of webs and antiwebs
71 -- 80Zhongyuan Che, Zhibo Chen 0003. Forcing faces in plane bipartite graphs (II)
81 -- 95Mahdi Cheraghchi. Noise-resilient group testing: Limitations and constructions
96 -- 106Alberto Costa, Pierre Hansen, Leo Liberti. On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square
107 -- 117Éva Czabarka, Péter L. Erdös, V. Johnson, V. Moulton. Generating functions for multi-labeled trees
118 -- 133Aiping Deng, Alexander K. Kelmans, Juan Meng. Laplacian spectra of regular graph transformations
134 -- 139Zhibin Du. An edge grafting theorem on the Estrada index of graphs and its applications
140 -- 150Petr A. Golovach, Daniël Paulusma, Jian Song. 4-coloring H-free graphs when H is small
151 -- 166Alain Goupil, Hugo Cloutier, Marie-Eve Pellerin. Generating functions for inscribed polyominoes
167 -- 175Santosh N. Kabadi, Abraham P. Punnen. Spanning cactus of a graph: Existence, extension, optimization, and approximation
176 -- 183Evangelos Kranakis, Oscar Morales Ponce, Ladislav Stacho. Strongly connected orientations of plane graphs
184 -- 199Julien Lesca, Michel Minoux, Patrice Perny. Compact versus noncompact LP formulations for minimizing convex Choquet integrals
200 -- 211Xiangwen Li, Sanming Zhou. Labeling outerplanar graphs with maximum degree three
212 -- 216Meili Liang, Bolian Liu. On the Randić index and girth of graphs
217 -- 243Patrick Niesink, Keven Poulin, Mateja Sajna. Computing transitive closure of bipolar weighted digraphs
244 -- 257Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski. On the maximum quasi-clique problem
258 -- 276Guillaume Sagnol. Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
277 -- 283Guifu Su, Liming Xiong, Lan Xu. On the Co-PI and Laplacian Co-PI eigenvalues of a graph
284 -- 293Ismael González Yero, Juan Alberto Rodríguez-Velazquez. Computing global offensive alliances in Cartesian product graphs
294 -- 300Jordan Bell. Cyclotomic orthomorphisms of finite fields
301 -- 306Ohad N. Feldheim, Rani Hod. 3/2 firefighters are not enough
307 -- 310Yingqian Wang, Lingji Xu. A sufficient condition for a plane graph with maximum degree 6 to be class 1
311 -- 314Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot. House of Graphs: A database of interesting graphs
315 -- 0Yves Crama, Peter L. Hammer. Boolean Functions