default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 27
Volume 27, Number 1, 2013
- Hamed Amini, Moez Draief, Marc Lelarge:
Flooding in Weighted Sparse Random Graphs. 1-26 - Roman Glebov, Michael Krivelevich:
On the Number of Hamilton Cycles in Sparse Random Graphs. 27-42 - Chien-Chung Huang, Telikepalli Kavitha:
Near-Popular Matchings in the Roommates Problem. 43-62 - Sylvia C. Boyd, Maryam Haghighi:
Mixed and Circular Multichromosomal Genomic Median Problem. 63-74 - Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Efficient Algorithms for Eulerian Extension and Rural Postman. 75-94 - Maria Chudnovsky
, Andrew D. King, Matthieu Plumettaz, Paul D. Seymour:
A Local Strengthening of Reed's Omega, Delta, Chi Conjecture for Quasi-line Graphs. 95-108 - Nicolai Hähnle, Laura Sanità, Rico Zenklusen:
Stable Routing and Unique-Max Coloring on Trees. 109-125 - Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki:
First-Fit Coloring of Incomparability Graphs. 126-140 - Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. 141-144 - Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Repeated Degrees in Random Uniform Hypergraphs. 145-154 - Naoki Katoh, Shin-ichi Tanigawa:
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. 155-185 - Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich:
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines. 186-204 - Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer Representations of Convex Polygon Intersection Graphs. 205-231 - Josef Cibulka:
Maximum Size of Reverse-Free Sets of Permutations. 232-239 - Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott:
Cover-Decomposition and Polychromatic Numbers. 240-256 - Robert Scheidweiler, Eberhard Triesch:
A Lower Bound for the Complexity of Monotone Graph Properties. 257-265 - Vijay V. Vazirani:
Nonseparable, Concave Utilities Are Easy - in a Perfect Price Discrimination Market Model. 266-273 - Zan-Bo Zhang, Xiaoyan Zhang, Xuelian Wen:
Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs. 274-289 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Subset Feedback Vertex Set Is Fixed-Parameter Tractable. 290-309 - Chun-Ying Chiang, Liang-Hao Huang, Hong-Gwa Yeh:
Target Set Selection Problem for Honeycomb Networks. 310-328 - Bertrand Guenin, Irene Pivotto, Paul Wollan:
Relationships between Pairs of Representations of Signed Binary Matroids. 329-341 - Graeme Kemkes, Nicholas C. Wormald:
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph. 342-362 - Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Adversarial Leakage in Games. 363-385 - Pu Gao:
Distributions of Sparse Spanning Subgraphs in Random Graphs. 386-401 - Michael Snook:
The Complexity of Deletion Problems for Matroids. 402-421 - Kenta Ozeki:
Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces. 422-435 - Jakub Kozik, Piotr Micek:
Nonrepetitive Choice Number of Trees. 436-446 - Hoi H. Nguyen:
On the Singularity of Random Combinatorial Matrices. 447-458 - Kristin M. Shaw:
A Tropical Intersection Product in Matroidal Fans. 459-491 - Robert Brijder, Hendrik Jan Hoogeboom:
Nullity and Loop Complementation for Delta-Matroids. 492-506 - Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Hypergraphic LP Relaxations for Steiner Trees. 507-533 - Daniel W. Cranston, Landon Rabern:
Coloring Claw-Free Graphs with Delta-1 Colors. 534-549 - Jacob Fox, János Pach, Andrew Suk:
The Number of Edges in k-Quasi-planar Graphs. 550-561 - Noga Alon:
Minimizing the Number of Carries in Addition. 562-566 - Olivier Durand de Gevigney, Viet Hang Nguyen, Zoltán Szigeti:
Matroid-Based Packing of Arborescences. 567-574 - Simeon Ball, Aart Blokhuis:
A Bound for the Maximum Weight of a Linear Code. 575-583 - Owen Hill, Gexin Yu:
A Relaxation of Steinberg's Conjecture. 584-596
Volume 27, Number 2, 2013
- Zhiquan Hu, Ka Ho Law, Wenan Zang:
An Optimal Binding Number Condition for Bipancyclism. 597-618 - Etienne de Klerk, Dmitrii V. Pasechnik, Gelasio Salazar:
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs. 619-633 - Graham R. Brightwell, Mareike Massow:
Diametral Pairs of Linear Extensions. 634-649 - Sariel Har-Peled, Bernard Lidický:
Peeling the Grid. 650-655 - Noga Alon, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Tom Leighton:
Basic Network Creation Games. 656-668 - Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Decomposition of Binary Signed-Graphic Matroids. 669-692 - Peter Keevash, Zhentao Li, Bojan Mohar, Bruce A. Reed:
Digraph Girth via Chromatic Number. 693-696 - Maya Stein, José Zamora:
Forcing Large Complete (Topological) Minors in Infinite Graphs. 697-707 - Allen O'Neal, Peter J. Slater:
Uniqueness of Vertex Magic Constants. 708-716 - Carmen C. Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Geodetic Number versus Hull Number in P3-Convexity. 717-731 - Anthony Bonato, Dieter Mitsche, Pawel Pralat:
Vertex-Pursuit in Random Directed Acyclic Graphs. 732-756 - Edita Mácajová:
Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable. 757-767 - Alan M. Frieze, Simcha Haber, Mikhail Lavrov:
On the Game Chromatic Number of Sparse Random Graphs. 768-790 - Yin Tan, Longjiang Qu, San Ling, Chik How Tan:
On the Fourier Spectra of New APN Functions. 791-801 - Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth:
Bounds on the Maximum Multiplicity of Some Common Geometric Graphs. 802-826 - Daniel Simson:
A Coxeter-Gram Classification of Positive Simply Laced Edge-Bipartite Graphs. 827-854 - Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler:
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. 855-891 - Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Counting and Detecting Small Subgraphs via Equations. 892-909 - John L. Goldwasser, Ryan Hansen:
The Exact Turán Number of F(3, 3) and All Extremal Configurations. 910-917 - Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa:
Finding 2-Factors Closer to TSP Tours in Cubic Graphs. 918-939 - Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
On the Number of Perfect Matchings in a Bipartite Graph. 940-958 - Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Self-Similarity of Graphs. 959-972 - Sergei V. Konyagin, Misha Rudnev:
On New Sum-Product-Type Estimates. 973-990 - Wendy Finbow-Singh, Walter Whiteley:
Isostatic Block and Hole Frameworks. 991-1020 - Imdadullah Khan:
Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree. 1021-1039 - Paul Horn, Steve La Fleur, Vojtech Rödl:
Jumps and Nonjumps in Multigraphs. 1040-1054 - Lajos Hajdu, Robert Tijdeman:
Bounds for Approximate Discrete Tomography Solutions. 1055-1066 - Sarit Buzaglo, Tuvi Etzion:
Tilings by (0.5, n)-Crosses and Perfect Codes. 1067-1081 - Tomas Rokicki, Herbert Kociemba, Morley Davidson, John Dethridge:
The Diameter of the Rubik's Cube Group Is Twenty. 1082-1105 - Suho Oh, Hwanchul Yoo, Taedong Yun:
Rainbow Graphs and Switching Classes. 1106-1111 - Koji Momihara:
Skew Hadamard Difference Sets from Cyclotomic Strongly Regular Graphs. 1112-1122 - Michel X. Goemans, José A. Soto:
Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations. 1123-1145 - Steven Klee, Isabella Novik:
From Flag Complexes to Banner Complexes. 1146-1158 - Juan Carlos Ku-Cauich, Horacio Tapia-Recillas:
Systematic Authentication Codes Based on a Class of Bent Functions and the Gray Map on a Galois Ring. 1159-1170 - Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
Drawing Planar Graphs of Bounded Degree with Few Slopes. 1171-1183 - Katherine Edwards, Andrew D. King:
Bounding the Fractional Chromatic Number of KDelta-Free Graphs. 1184-1208
Volume 27, Number 3, 2013
- Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Optimizing the Graph Minors Weak Structure Theorem. 1209-1227 - Abbas Mehrabian, Dieter Mitsche, Pawel Pralat:
On the Maximum Density of Graphs with Unique-Path Labelings. 1228-1233 - Ryo Fujita, Yusuke Kobayashi, Kazuhisa Makino:
Robust Matchings and Matroid Intersections. 1234-1256 - Naonori Kakimura, Kazuhisa Makino:
Robust Independence Systems. 1257-1273 - Daniel Kotlar:
On Circuits and Serial Symmetric Basis-Exchange in Matroids. 1274-1286 - Péter L. Erdös, Claude Tardif, Gábor Tardos:
Caterpillar Dualities and Regular Languages. 1287-1294 - Niek Bouman, Jan Draisma, Johan van Leeuwaarden:
Energy Minimization of Repelling Particles on a Toric Grid. 1295-1312 - Jakub Przybylo:
Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz. 1313-1322 - Andrew Suk:
Density Theorems for Intersection Graphs of t-Monotone Curves. 1323-1334 - Josef Dick, Makoto Matsumoto:
On the Fast Computation of the Weight Enumerator Polynomial and the t Value of Digital Nets over Finite Abelian Groups. 1335-1359 - Victoria Horan, Glenn Hurlbert:
Universal Cycles for Weak Orders. 1360-1371 - Deryk Osthus, Katherine Staden:
Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs. 1372-1409 - Anthony Labarre:
Lower Bounding Edit Distances between Permutations. 1410-1428 - Maria Axenovich, Andrew Beveridge, Joan P. Hutchinson, Douglas B. West:
Visibility Number of Directed Graphs. 1429-1449 - Joseph Cheriyan, Bundit Laekhanukit:
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S, T)$ Connected Digraphs. 1450-1481 - Simeon Ball, Carles Padró, Zsuzsa Weiner, Chaoping Xing:
On the Representability of the Biuniform Matroid. 1482-1491 - Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. 1492-1502 - Marek Cygan, Guy Kortsarz, Zeev Nutov:
Steiner Forest Orientation Problems. 1503-1513 - Guoli Ding, Stan Dziobiak:
On 3-Connected Graphs of Path-Width at Most Three. 1514-1526 - Gruia Calinescu:
Approximate Min-Power Strong Connectivity. 1527-1543 - Brian H. Marcus, Ronnie Pavlov:
Computing Bounds for Entropy of Stationary Zd Markov Random Fields. 1544-1558 - Paul Dorbec, Michael A. Henning, Christian Löwenstein, Mickaël Montassier, André Raspaud:
Generalized Power Domination in Regular Graphs. 1559-1574 - János Körner, Irene Muzi:
Degree-Doubling Graph Families. 1575-1583 - Hong Shen, Shihong Xu:
Approximation Algorithms for Fault Tolerant Facility Allocation. 1584-1609 - Gennadiy Averkov:
On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets. 1610-1624 - Shinya Fujita, Colton Magnant:
Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs. 1625-1637
Volume 27, Number 4, 2013
- Peter Bürgisser, Christian Ikenmeyer:
Deciding Positivity of Littlewood-Richardson Coefficients. 1639-1681 - Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
Advancing the Transposition Distance and Diameter through Lonely Permutations. 1682-1709 - Tibor Jordán, Gábor Domokos, Krisztina Tóth:
Geometric Sensitivity of Rigid Graphs. 1710-1726 - Michael S. Payne, David R. Wood:
On the General Position Subset Selection Problem. 1727-1733 - Richard C. Brewster, Sean McGuinness, Morten Hegner Nielsen:
Factors with Multiple Degree Constraints in Graphs. 1734-1747 - Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing Random Walks and Voting on Connected Graphs. 1748-1758 - Lee-Ad Gottlieb, Robert Krauthgamer:
Proximity Algorithms for Nearly Doubling Spaces. 1759-1769 - Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. 1770-1774 - Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. 1775-1787 - Guantao Chen, Akira Saito, Songling Shan:
The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition. 1788-1799 - Timothy D. LeSaulnier, Noah Prince, Paul S. Wenger, Douglas B. West, Pratik Worah:
Total Acquisition in Graphs. 1800-1819 - Paul H. Edelman, Tatiana Gvozdeva, Arkadii M. Slinko:
Simplicial Complexes Obtained from Qualitative Probability Orders. 1820-1843 - Yeow Meng Chee, Charles J. Colbourn, Daniel Horsley, Junling Zhou:
Sequence Covering Arrays. 1844-1861 - Hongliang Lu, David G. L. Wang, Qinglin Yu:
On the Existence of General Factors in Regular Graphs. 1862-1869 - Igor E. Shparlinski:
Additive Decompositions of Subgroups of Finite Fields. 1870-1879 - T. Kyle Petersen:
On the Shard Intersection Order of a Coxeter Group. 1880-1912 - Atif A. Abueida, Arthur H. Busch, R. Sritharan:
Hamiltonian Spider Intersection Graphs Are Cycle Extendable. 1913-1923 - James M. Carraher, Stephen G. Hartke:
Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs. 1924-1939 - Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. 1940-1963 - Fedor V. Fomin, Saket Saurabh, Yngve Villanger:
A Polynomial Kernel for Proper Interval Vertex Deletion. 1964-1976 - Cunsheng Ding:
Cyclic Codes from Some Monomials and Trinomials. 1977-1994 - József Balogh, Cory Palmer:
On the Tree Packing Conjecture. 1995-2006 - Hartmut Führ, Isaac Z. Pesenson:
Poincaré and Plancherel-Polya Inequalities in Harmonic Analysis on Weighted Combinatorial Graphs. 2007-2028 - Yingqian Wang, Lingji Xu:
Improper Choosability of Planar Graphs without 4-Cycles. 2029-2037 - Le Anh Vinh:
On Four-Variable Expanders in Finite Fields. 2038-2048 - Guy Even, Nissim Halabi:
Local-Optimality Guarantees Based on Paths for Optimal Decoding. 2049-2063 - Catherine S. Greenhill, Brendan D. McKay:
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees. 2064-2089 - William B. Kinnersley, Douglas B. West, Reza Zamani:
Extremal Problems for Game Domination Number. 2090-2107 - Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. 2108-2142 - Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. 2143-2156 - Pawel Pralat:
Sparse Graphs Are Not Flammable. 2157-2166
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 2025-11-28 23:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
