default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 34
Volume 34, Number 1, 2020
- Stefan Felsner, Linda Kleist
, Torsten Mütze, Leon Sering:
Rainbow Cycles in Flip Graphs. 1-39 - Michal Debski, Jaroslaw Grytczuk, Barbara Nayar, Urszula Pastwa, Joanna Sokól, Michal Tuczynski, Przemyslaw Wenus, Krzysztof Wesek:
Avoiding Multiple Repetitions in Euclidean Spaces. 40-52 - Alan M. Frieze, Tomasz Tkocz:
Random Graphs with a Fixed Maximum Degree. 53-61 - Frantisek Kardos:
A Computer-Assisted Proof of the Barnette-Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian. 62-100 - Robert Krauthgamer, Havana Rika:
Refined Vertex Sparsifiers of Planar Graphs. 101-129 - Gramoz Goranci, Monika Henzinger, Pan Peng:
Improved Guarantees for Vertex Sparsification in Planar Graphs. 130-162 - Tony Huynh, Peter Nelson:
The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids. 163-176 - Sara Fish, Cosmin Pohoata, Adam Sheffer:
Local Properties via Color Energy Graphs and Forbidden Configurations. 177-187 - Robert Lukotka:
Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits. 188-211 - Dániel Garamvölgyi, Tibor Jordán:
Global Rigidity of Unit Ball Graphs. 212-229 - Anurag Bishnoi, Valentina Pepe:
Nonintersecting Ryser Hypergraphs. 230-240 - Oliver Janzer:
The Extremal Number of the Subdivisions of the Complete Bipartite Graph. 241-250 - Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar:
Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems. 251-270 - Ran Gu, Jiaao Li, Yongtang Shi:
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs. 271-307 - Alexander I. Barvinok, Anthony Della Pella:
Testing for Dense Subsets in a Graph via the Partition Function. 308-327 - Marcin Wrochna:
Homomorphism Reconfiguration via Homotopy. 328-350 - Dániel Gerbner, Abhishek Methuku, Gholam Reza Omidi, Máté Vizer:
Ramsey Problems for Berge Hypergraphs. 351-369 - Laure Marêché:
Combinatorics for General Kinetically Constrained Spin Models. 370-384 - David Conlon, Jacob Fox, Benny Sudakov:
Books versus Triangles at the Extremal Density. 385-398 - Brant Jones:
Weighted Games of Best Choice. 399-414 - Joshua Erde:
Directed Path-Decompositions. 415-430 - Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. 431-469 - Marcel Kenji de Carli Silva, Levent Tunçel:
A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations. 470-496 - Daniel W. Cranston, Jiaao Li:
Circular Flows in Planar Graphs. 497-519 - Venkatesan Guruswami, Sai Sandeep:
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. 520-537 - Zdenek Dvorák, Xiaolan Hu:
Fractional Coloring of Planar Graphs of Girth Five. 538-555 - Tao Jiang, Yu Qiu:
Turán Numbers of Bipartite Subdivisions. 556-570 - Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Finding Submodularity Hidden in Symmetric Difference. 571-585 - Kevin G. Milans, Michael C. Wigal:
A Dichotomy Theorem for First-Fit Chain Partitions. 586-596 - Peter J. Dukes, Daniel Horsley:
On the Minimum Degree Required for a Triangle Decomposition. 597-610 - Xin Fang, Ghislain Fourier, Jan-Philipp Litza, Christoph Pegel:
A Continuous Family of Marked Poset Polytopes. 611-639 - Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. 640-681 - Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Impact of Locality in the Broadcast Congested Clique Model. 682-700 - Daniel Irving Bernstein:
L-Infinity Optimization to Bergman Fans of Matroids with an Application to Phylogenetics. 701-720 - Boris Bukh, Raymond Hogenson:
Length of the Longest Common Subsequence between Overlapping Words. 721-729 - Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. 730-741 - Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang:
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. 742-793 - Bhaswar B. Bhattacharya, Somabha Mukherjee, Sumit Mukherjee:
The Second-Moment Phenomenon for Monochromatic Subgraphs. 794-824 - Silvia Butti, Stanislav Zivný:
Sparsification of Binary CSPs. 825-842 - Khaled M. Elbassioni, Kazuhisa Makino:
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices. 843-864 - Alantha Newman:
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs. 865-884 - Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku:
Multitasking Capacity: Hardness Results and Improved Constructions. 885-903 - Ran Gelles, Rafail Ostrovsky, Alan Roytman:
Efficient Error-Correcting Codes for Sliding Windows. 904-937 - Ken Yamamoto:
Large Deviation Theorem for Branches of the Random Binary Tree in the Horton-Strahler Analysis. 938-949 - Uriel Feige, Anne Kenyon, Shimon Kogan:
On the Profile of Multiplicities of Complete Subgraphs. 950-971 - O-joung Kwon, Sang-il Oum:
Scattered Classes of Graphs. 972-999 - Zihan Tan, Liwei Zeng:
Erratum for "On the Inequalities of Projected Volumes and the Constructible Region". 1000
Volume 34, Number 2, 2020
- Rajko Nenadov, Yanitsa Pehova:
On a Ramsey-Turán Variant of the Hajnal-Szemerédi Theorem. 1001-1010 - Toufik Mansour, Reza Rastegar, Alexander Roitershtein:
Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations. 1011-1038 - Benjamin Plaut, Tim Roughgarden:
Almost Envy-Freeness with General Valuations. 1039-1068 - Bhaswar B. Bhattacharya, Shirshendu Ganguly:
Upper Tails for Edge Eigenvalues of Random Graphs. 1069-1083 - Rémy Belmonte, Michael Lampis, Valia Mitsou:
Parameterized (Approximate) Defective Coloring. 1084-1106 - Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. 1107-1147 - Ryan Gabrys, Son Hoang Dau, Charles J. Colbourn, Olgica Milenkovic:
Set-Codes with Small Intersections and Small Discrepancies. 1148-1171 - Michael Joswig, Georg Loho:
Monomial Tropical Cones for Multicriteria Optimization. 1172-1191 - Yezhou Wu, Dong Ye:
Minimum T-Joins and Signed-Circuit Covering. 1192-1204 - Sean Dewar:
Infinitesimal Rigidity in Normed Planes. 1205-1231 - Paul Beame, Shayan Oveis Gharan, Xin Yang:
On the Bias of Reed-Muller Codes over Odd Prime Fields. 1232-1247 - Pavel Etingof:
Angle-Restricted Sets and Zero-Free Regions for the Permanent. 1248-1260 - Christian Haase, Florian Kohl, Akiyoshi Tsuchiya:
Levelness of Order Polytopes. 1261-1280 - Neil J. Y. Fan, Peter L. Guo, Simon C. Y. Peng, Sophie C. C. Sun:
Lattice Points in the Newton Polytopes of Key Polynomials. 1281-1289 - Jun Gao, Jie Ma:
A Conjecture of Verstraëte on Vertex-Disjoint Cycles. 1290-1301 - Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale:
Path Contraction Faster than 2n. 1302-1325 - Danila D. Cherkashin, Fedor Petrov:
Regular Behavior of the Maximal Hypergraph Chromatic Number. 1326-1333 - Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-Cut. 1334-1353 - Debsoumya Chakraborti, Po-Shen Loh:
Extremal Graphs with Local Covering Conditions. 1354-1374 - Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar:
Cops and Robbers on Graphs of Bounded Diameter. 1375-1384 - Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari:
Odd Multiway Cut in Directed Acyclic Graphs. 1385-1408 - Alexander Birx, Yann Disser:
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. 1409-1443 - Ivailo Hartarsky, Tamás Róbert Mezei:
Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness. 1444-1459 - Sebastián Bustamante, Jan Corsten, Nóra Frankl, Alexey Pokrovskiy, Jozef Skokan:
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles. 1460-1471 - Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. 1472-1483
Volume 34, Number 3, 2020
- Hui Zhu, Liying Kang, Zhenyu Ni, Erfang Shan:
The Turán Number of Berge-K4 in 3-Uniform Hypergraphs. 1485-1492 - Chong Shangguan, Itzhak Tamo:
Sparse Hypergraphs with Applications to Coding Theory. 1493-1504 - Pasin Manurangsi, Warut Suksompong:
When Do Envy-Free Allocations Exist? 1505-1521 - Tara Fife, Dillon Mayhew, James G. Oxley, Charles Semple:
The Unbreakable Frame Matroids. 1522-1537 - Michael Lampis:
Finer Tight Bounds for Coloring on Clique-Width. 1538-1558 - Abigail Raz:
Upper Tail Bounds for Cycles. 1559-1586 - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Going Far from Degeneracy. 1587-1601 - Hailong Dao, Joseph Doolittle, Justin Lyle:
Minimal Cohen-Macaulay Simplicial Complexes. 1602-1608 - Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer:
Erdös-Pósa from Ball Packing. 1609-1619 - Boris Bukh, Oleksandr Rudenko:
Order-Isomorphic Twins in Permutations. 1620-1622 - Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. 1623-1648 - Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization. 1649-1669 - Matthew Coulson, Guillem Perarnau:
A Rainbow Dirac's Theorem. 1670-1692 - Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-Closed Graph Classes with Bounded Layered Pathwidth. 1693-1709 - Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Min-Orderable Digraphs. 1710-1724 - Daniel W. Cranston, Matthew P. Yancey:
Sparse Graphs Are Near-Bipartite. 1725-1768 - Marcelo Henriques de Carvalho, Nishad Kothari, Xiumei Wang, Yixun Lin:
Birkhoff-von Neumann Graphs that are PM-Compact. 1769-1790 - Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid:
Dynamic Balanced Graph Partitioning. 1791-1812 - Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
t-Wise Berge and t-Heavy Hypergraphs. 1813-1829 - Shishuo Fu, Guo-Niu Han, Zhicong Lin:
k-Arrangements, Statistics, and Patterns. 1830-1853 - Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. 1854-1883 - Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Cycles. 1884-1908 - Xuanlong Ma, Gary L. Walls, Kaishun Wang, Sanming Zhou:
Subgroup Perfect Codes in Cayley Graphs. 1909-1921 - Dhruv Mubayi, Caroline Terry:
Extremal Theory of Locally Sparse Multigraphs. 1922-1943 - Yuanan Diao, Claus Ernst, Gábor Hetyei:
Invariants of Rational Links Represented by Reduced Alternating Diagrams. 1944-1968 - Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell:
Bipartite Analogues of Comparability and Cocomparability Graphs. 1969-1983 - Brendan Murphy, James Wheeler:
Growth in Some Finite Three-Dimensional Matrix Groups. 1984-1998 - Gennian Ge, Yifan Jing, Zixiang Xu, Tao Zhang:
Color Isomorphic Even Cycles and a Related Ramsey Problem. 1999-2008 - Fei Huang, Shanshan Guo, Jinjiang Yuan:
A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs. 2009-2015
Volume 34, Number 4, 2020
- Jannik Silvanus, Jens Vygen:
Few Sequence Pairs Suffice: Representing All Rectangle Placements. 2017-2032 - Oliver Cooley, Wenjie Fang, Nicola Del Giudice, Mihyun Kang:
Subcritical Random Hypergraphs, High-Order Components, and Hypertrees. 2033-2062 - Lucas Laird, Richard C. Tillquist, Stephen Becker, Manuel E. Lladser:
Resolvability of Hamming Graphs. 2063-2081 - Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting Flows when Links Fail. 2082-2107 - Guido Besomi, Matías Pavez-Signé, Maya Stein:
Maximum and Minimum Degree Conditions for Embedding Trees. 2108-2123 - Simon Macourt, Giorgis Petridis, Ilya D. Shkredov, Igor E. Shparlinski:
Bounds of Trilinear and Trinomial Exponential Sums. 2124-2136 - Zdenek Dvorák, Xiaolan Hu:
(3a: a)-List-Colorability of Embedded Graphs of Girth at Least Five. 2137-2165 - You Lu, Rong Luo, Michael Schubert, Eckhard Steffen, Cun-Quan Zhang:
Flows on Signed Graphs without Long Barbells. 2166-2182 - Ken-ichi Kawarabayashi, Chao Xu:
Minimum Violation Vertex Maps and Their Applications to Cut Problems. 2183-2207 - Zixiang Xu, Gennian Ge:
Erdös-Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields. 2208-2220 - Gwenaël Joret, William Lochet:
Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture. 2221-2238 - Vojtech Dvorák, Peter van Hintum, Marius Tiba:
Improved Bound for Tomaszewski's Problem. 2239-2249 - Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi:
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. 2250-2269 - Peter Nelson, Sophia Park:
A Ramsey Theorem for Biased Graphs. 2270-2281 - Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. 2282-2299 - András Pongrácz:
Binary Linear Codes with Near-Extremal Maximum Distance. 2300-2317 - Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. 2318-2337 - Chong Shangguan, Itzhak Tamo:
New Turán Exponents for Two Extremal Hypergraph Problems. 2338-2345 - Linyuan Lu, Zhiyu Wang:
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees. 2346-2362 - Tristram Bogart, John Goodrick, Kevin Woods:
A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems. 2363-2387 - Stephen Melczer, Greta Panova, Robin Pemantle:
Counting Partitions inside a Rectangle. 2388-2410 - Alexey A. Glazyrin, Josiah Park:
Repeated Minimizers of p-Frame Energies. 2411-2423 - Benjamin Braun, Julianne Vega:
Hajós-Type Constructions and Neighborhood Complexes. 2424-2447 - Jin-Hui Fang:
On Generalized Perfect Difference Sumsets. 2448-2456 - Ergun Akleman, Jianer Chen, Jonathan L. Gross, Shiyu Hu:
A Topologically Complete Theory of Weaving. 2457-2480 - Mathieu Dutour Sikiric, Alexey Garber, Alexander Magazinov:
On the Voronoi Conjecture for Combinatorially Voronoi Parallelohedra in Dimension 5. 2481-2501 - Mehdi Makhul, Audie Warren, Arne Winterhof:
The Spherical Kakeya Problem in Finite Fields. 2502-2509 - Alexander Strang:
Solutions to the Minimum Variance Problem Using Delaunay Triangulation. 2510-2531 - Dániel Korándi, János Pach, István Tomon:
Large Homogeneous Submatrices. 2532-2552 - George Shakan:
A Large Gap in a Dilate of a Set. 2553-2555 - Jacob Fox, Fan Wei:
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion. 2556-2582 - Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu:
Erratum: The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. 2583-2584
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-04-09 21:08 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:
