default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 31
Volume 31, Number 1, 2017
- Richard W. Kenyon, David Bruce Wilson:
The Space of Circular Planar Electrical Networks. 1-28 - Florian Meier, Ueli Peter:
Push is Fast on Sparse Random Graphs. 29-49 - David E. Burstein, Jonathan E. Rubin
:
Sufficient Conditions for Graphicality of Bidegree Sequences. 50-62 - Andrew Gainer-Dewar, Paola Vera-Licona:
The Minimal Hitting Set Generation Problem: Algorithms and Computation. 63-100 - Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich:
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. 101-123 - Tao Jiang, Andrew Newman:
Small Dense Subgraphs of a Graph. 124-142 - Rudi Mrazovic:
One-Point Concentration of the Clique and Chromatic Numbers of the Random Cayley Graph on 픽2. 143-154 - Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. 155-171 - Stefan Felsner, Irina Mustata, Martin Pergel:
The Complexity of the Partial Order Dimension Problem: Closing the Gap. 172-189 - James M. Carraher, Stephen G. Hartke:
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three. 190-209 - Peng Li, Yaokun Wu:
A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs. 210-239 - Longxiu Huang, Tao Wang:
On the Number of Neighbors in Normal Tiling. 240-253 - Kevin Grace, Stefan H. M. van Zwam:
Templates for Binary Matroids. 254-282 - Martin Hoefer, Lisa Wagner:
Locally Stable Marriage with Strict Preferences. 283-316 - Kassie Archer, Scott M. LaLonde:
Allowed Patterns of Symmetric Tent Maps via Commuter Functions. 317-334 - Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. 335-382 - Katherine Staden, Andrew Treglown:
On Degree Sequences Forcing The Square of a Hamilton Cycle. 383-437 - Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis:
The Excluded Minors for Isometric Realizability in the Plane. 438-453 - Hung-Chun Liang, Hsueh-I Lu:
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths. 454-476 - Amanda Redlich:
A Power-of-Two-Choices Unbalanced Allocation Process. 477-488 - Alan M. Frieze, Tony Johansson:
Minimum Cost Matching in a Random Graph with Random Costs. 489-510 - Petr A. Golovach, Marcin Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos:
The Parameterized Complexity of Graph Cyclability. 511-541 - N. R. Aravind, R. B. Sandeep, Naveen Sivadasan:
Dichotomy Results on the Hardness of H-free Edge Modification Problems. 542-561 - James R. Lee:
Covering the Large Spectrum and Generalized Riesz Products. 562-572 - Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. 573-596 - Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur:
Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation. 597-631 - Sylvia C. Boyd, Philippe Legault:
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph. 632-644 - J. Adrian Bondy, Zbigniew Lonc, Pawel Rzazewski:
Erratum: Constructing Optimal k-Radius Sequences. 645-646
Volume 31, Number 2, 2017
- Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumor Spreading. 647-668 - Gerard Jennhwa Chang, Guan-Huei Duh, Tsai-Lien Wong, Xuding Zhu:
Total Weight Choosability of Trees. 669-686 - Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. 687-713 - Ringi Kim:
Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets. 714-725 - Daniel W. Cranston, Landon Rabern:
List-Coloring Claw-Free Graphs with Δ-1 Colors. 726-748 - Oded Regev, Noah Stephens-Davidowitz:
An Inequality for Gaussians on Lattices. 749-757 - Sandy H. L. Chen, Amy M. Fu:
A 4n-Point Elliptic Interpolation Formula and its Applications. 758-765 - Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. 766-782 - Marie Mauhar, Joseph Rusinko, Zoe Vernon:
H-Representation of the Kimura-3 Polytope for the m-Claw Tree. 783-795 - Xingde Jia, Jian Shen:
Extremal Bases for Finite Cyclic Groups. 796-804 - Vida Dujmovic, David Eppstein, David R. Wood:
Structure of Graphs with Locally Restricted Crossings. 805-824 - Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. 825-838 - Monika Balvociute, David Bryant, Andreas Spillner:
When Can Splits be Drawn in the Plane? 839-856 - Michael S. Payne:
Bichromatic Lines in the Plane. 857-864 - Zdenek Dvorák, Bernard Lidický:
Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles. 865-874 - Daniel Irving Bernstein, Colby Long:
L-Infinity Optimization to Linear Spaces and Phylogenetic Trees. 875-889 - Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto:
On Dominating Even Subgraphs in Cubic Graphs. 890-907 - Wei-Hsuan Yu:
New Bounds for Equiangular Lines and Spherical Two-Distance Sets. 908-917 - Arthur L. B. Yang, Philip B. Zhang:
Brenti's Open Problem on the Real-Rootedness of q-Eulerian Polynomials of Type D. 918-926 - Eimear Byrne, Alberto Ravagnani:
Covering Radius of Matrix Codes Endowed with the Rank Metric. 927-944 - Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. 945-982 - Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. 983-1016 - Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. 1017-1071 - Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi:
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. 1072-1148 - Hongliang Lu, David G. L. Wang:
A Tutte-Type Characterization for Graph Factors. 1149-1159 - Amin Coja-Oghlan, Amir Haqshenas, Samuel Hetterich:
Walksat Stalls Well Below Satisfiability. 1160-1173 - Andrea Francke, Csaba D. Tóth:
A Census of Plane Graphs with Polyline Edges. 1174-1195 - Christoph Helmberg, Israel Rocha, Uwe Schwerdtfeger:
Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs. 1196-1216 - Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Tree-length Graphs. 1217-1243 - Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu:
Deciding Orthogonality in Construction-A Lattices. 1244-1262 - Arnold Filtser, Robert Krauthgamer:
Sparsification of Two-Variable Valued Constraint Satisfaction Problems. 1263-1276 - Kaushik Sarkar, Charles J. Colbourn:
Upper Bounds on the Size of Covering Arrays. 1277-1293 - Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. 1294-1327 - Dieter Mitsche, Guillem Perarnau:
On Treewidth and Related Parameters of Random Geometric Graphs. 1328-1354 - Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. 1355-1373 - Richard Lang, Oliver Schaudt, Maya Stein:
Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles. 1374-1402 - Eimear Byrne, Marco Calderini:
Bounding the Optimal Rate of the ICSI and ICCSI problem. 1403-1427 - Pierre-Louis Giscard, Paul Rochet:
Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs. 1428-1453 - Jean-Claude Belfiore, Cem Güneri, Buket Özkaya:
Quasi-Cyclic Subcodes of Cyclic Codes. 1454-1475
Volume 31, Number 3, 2017
- Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller:
Packing a Knapsack of Unknown Capacity. 1477-1497 - Ryan R. Martin, Richard Mycroft, Jozef Skokan:
An Asymptotic Multipartite Kühn-Osthus Theorem. 1498-1513 - Reinhard Diestel, Philipp Eberenz, Joshua Erde:
Duality Theorems for Blocks and Tangles in Graphs. 1514-1528 - Joshua Erde:
Refining a Tree-Decomposition which Distinguishes Tangles. 1529-1551 - Venkatesan Guruswami, Euiwoong Lee:
Inapproximability of H-Transversal/Packing. 1552-1571 - Zi-Xia Song, Brian Thomas:
Hadwiger's Conjecture for Graphs with Forbidden Holes. 1572-1580 - Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Hitting Selected (Odd) Cycles. 1581-1615 - Henning Bruhn, Elke Fuchs:
t-Perfection in P5-Free Graphs. 1616-1633 - G. R. Omidi, Maryam Shahsiah:
Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs. 1634-1669 - Wouter Cames van Batenburg, Louis Esperet, Tobias Müller:
Coloring Jordan Regions and Curves. 1670-1684 - Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. 1685-1701 - Julio Aracena, Adrien Richard, Lilian Salinas:
Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks. 1702-1725 - Ron Aharoni, Dani Kotlar, Ran Ziv:
Representation of Large Matchings in Bipartite Graphs. 1726-1731 - Éva Czabarka, László A. Székely, Stephan G. Wagner:
Inducibility in Binary Trees and Crossings in Random Tanglegrams. 1732-1750 - Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams:
Who Can Win a Single-Elimination Tournament? 1751-1764 - Monique Laurent, Matteo Seminaroti:
Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition. 1765-1800 - Naoyuki Kamiyama:
Popular Matchings with Ties and Matroid Constraints. 1801-1819 - Klaus Heeger, Jens Vygen:
Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges. 1820-1835 - Ligang Jin, Ying-li Kang, Michael Schubert, Yingqian Wang:
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable. 1836-1847 - József Balogh, Hong Liu, Maryam Sharifzadeh:
On Two Problems in Ramsey-Turán Theory. 1848-1866 - Dayu He, Xin He:
Optimal Monotone Drawings of Trees. 1867-1877 - Brendan Murphy, Oliver Roche-Newton, Ilya D. Shkredov:
Variations on the Sum-Product Problem II. 1878-1894 - Kenz Kallal, Tomoka Kan, Eric Wang:
Improved Lower Bounds for Kissing Numbers in Dimensions 25 through 31. 1895-1908 - Jiaao Li, Hong-Jian Lai, Rong Luo:
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees. 1909-1922 - Edita Mácajová, Martin Skoviera:
Odd Decompositions of Eulerian Graphs. 1923-1936 - Edita Mácajová, Martin Skoviera:
Nowhere-Zero Flows on Signed Eulerian Graphs. 1937-1952 - Alejandro H. Morales, Igor Pak, Greta Panova:
Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications. 1953-1989 - Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma, Dingjun Lou:
Extremal and Degree Conditions for Path Extendability in Digraphs. 1990-2014 - Bo Lin, Bernd Sturmfels, Xiaoxian Tang, Ruriko Yoshida:
Convexity in Tree Spaces. 2015-2038 - Daniel W. Cranston, Landon Rabern:
Short Fans and the 5/6 Bound for Line Graphs. 2039-2063 - Jean-Philippe Labbé, Eran Nevo:
Bounds for Entries of γ-Vectors of Flag Homology Spheres. 2064-2078 - Andrzej Dudek, Pawel Pralat:
On some Multicolor Ramsey Properties of Random Graphs. 2079-2092 - Davide Bolognini, Antonio Macchia, Emanuele Ventura, Volkmar Welker:
The Poset of Proper Divisibility. 2093-2109 - Raimundo Briceño, Ronnie Pavlov:
Strong Spatial Mixing in Homomorphism Spaces. 2110-2137 - Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. 2138-2171 - Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. 2172-2184 - Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. 2185-2200 - Zhentao Li, Bojan Mohar:
Planar Digraphs of Digirth Four are 2-Colorable. 2201-2205 - Dong Yeap Kang, Jaehoon Kim, Younjin Kim, Geewon Suh:
Sparse Spanning k-Connected Subgraphs in Tournaments. 2206-2227 - Sejun Park, Jinwoo Shin:
Convergence and Correctness of Max-Product Belief Propagation for Linear Programming. 2228-2246 - Yinghui Wang, Richard P. Stanley:
The Smith Normal Form Distribution of A Random Integer Matrix. 2247-2268 - Mladen Kovacevic, Vincent Y. F. Tan:
Improved Bounds on Sidon Sets via Lattice Packings of Simplices. 2269-2278
Volume 31, Number 4, 2017
- David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný:
Binarisation for Valued Constraint Satisfaction Problems. 2279-2300 - Silouanos Brazitikos, Thodoris Karageorgos:
An Algorithmic Regularity Lemma for Lp Regular Sparse Matrices. 2301-2313 - Dániel Gerbner, Cory Palmer:
Extremal Results for Berge Hypergraphs. 2314-2327 - Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg:
Loose Hamiltonian Cycles Forced by Large (k-2)-Degree - Approximate Version. 2328-2347 - Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha:
Popular Matchings with Two-Sided Preferences and One-Sided Ties. 2348-2377 - Thomas Chappell, Tobias Friedl, Raman Sanyal:
Two Double Poset Polytopes. 2378-2413 - Jeannette C. M. Janssen, Abbas Mehrabian:
Rumors Spread Slowly in a Small-World Spatial Network. 2414-2428 - Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya:
Plane Triangulations Without a Spanning Halin Subgraph II. 2429-2439 - Meirav Zehavi:
Maximum Minimal Vertex Cover Parameterized by Vertex Cover. 2440-2456 - Beifang Chen:
Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs. 2457-2478 - Brendan Nagle:
Constructive Packings of Triple Systems. 2479-2516 - Noga Alon, Guy Rutenberg:
Broadcast Transmission to Prioritizing Receivers. 2517-2529 - Shuxing Li:
The Minimum Distance of Some Narrow-Sense Primitive BCH Codes. 2530-2569 - Vladimir Grujic:
Quasisymmetric Functions for Nestohedra. 2570-2585 - Francis Black, Elizabeth Drellich, Julianna Tymoczko:
Valid Plane Trees: Combinatorial Models for RNA Secondary Structures with Watson-Crick Base Pairs. 2586-2602 - Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless:
Steiner Triple Systems with High Chromatic Index. 2603-2611 - António Pedro Goucha, João Gouveia, Pedro M. Silva:
On Ranks of Regular Polygons. 2612-2625 - Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. 2626-2646 - Carlos Hoppen, Hanno Lefmann, Knut Odermann:
A Rainbow Erdös-Rothschild Problem. 2647-2674 - Federico Ardila, Hanner Bastidas, Cesar Ceballos, John Guo:
The Configuration Space of a Robotic Arm in a Tunnel. 2675-2702 - Lele Wang, Ofer Shayevitz:
Graph Information Ratio. 2703-2734 - Robert Connelly, Steven J. Gortler:
Prestress Stability of Triangulated Convex Polytopes and Universal Second-Order Rigidity. 2735-2753 - Gwenaël Joret, Piotr Micek, Veit Wiechert:
Planar Posets Have Dimension at Most Linear in Their Height. 2754-2790
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-11 23:08 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:
