default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 24
Volume 24, Number 1, 2010
- Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Resilient Pancyclicity of Random and Pseudorandom Graphs. 1-16 - Reinhard Steffens, Thorsten Theobald
:
Combinatorics and Genus of Tropical Intersections and Ehrhart Theory. 17-32 - Yeow Meng Chee, Gennian Ge, Alan C. H. Ling:
Spectrum of Sizes for Perfect Deletion-Correcting Codes. 33-55 - Ken-ichi Kawarabayashi, Bojan Mohar:
Star Coloring and Acyclic Coloring of Locally Planar Graphs. 56-71 - Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
A Lower Bound for Network Navigability. 72-81 - Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul:
Distinguishing Chromatic Number of Cartesian Products of Graphs. 82-100 - Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh:
Retractions to Pseudoforests. 101-112 - Igor Pak, Ernesto Vallejo:
Reductions of Young Tableau Bijections. 113-145 - Aleksandrs Slivkins:
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs. 146-157 - Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Minimal Inequalities for an Infinite Relaxation of Integer Programs. 158-168 - David J. Grynkiewicz, Vsevolod F. Lev:
1-Saturating Sets, Caps, and Doubling-Critical Sets in Binary Spaces. 169-190 - A. B. Dieker:
Interlacings for Random Walks on Weighted Graphs and the Interchange Process. 191-206 - Andriy V. Bondarenko, Maryna S. Viazovska:
Spherical Designs via Brouwer Fixed Point Theorem. 207-217 - Gennian Ge, Dawei Huang, Ying Miao:
Monotonic Directed Designs. 218-238 - Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs. 239-254 - Guy Kortsarz, Michael Langberg, Zeev Nutov:
Approximating Maximum Subgraphs without Short Cycles. 255-269 - Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani:
Design is as Easy as Optimization. 270-286 - Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. 287-300 - André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
k-Robust Single-Message Transmission. 301-321 - Brendan Nagle:
On Computing the Frequencies of Induced Subhypergraphs. 322-329 - Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal:
Short Cycle Covers of Graphs with Minimum Degree Three. 330-355
Volume 24, Number 2, 2010
- Jan Hladký, Mathias Schacht:
Note on Bipartite Graph Tilings. 357-362 - Viet Hang Nguyen:
On Abstract Rigidity Matroids. 363-369 - Feng Ming Dong, Khee Meng Koh:
On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs. 370-378 - Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Removing Independently Even Crossings. 379-393 - David G. Glynn:
The Conjectures of Alon--Tarsi and Rota in Dimension Prime Minus One. 394-399 - Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau:
Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. 400-419 - Jeannette C. M. Janssen, Pawel Pralat:
Rank-Based Attachment Leads to Power Law Graphs. 420-440 - Graham R. Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth:
Permutation Capacities of Families of Oriented Infinite Paths. 441-456 - Klaus Jansen:
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. 457-485 - Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead:
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees. 486-504 - Ernie Croot, Derrick Hart:
h-Fold Sums from a Set with Few Products. 505-519 - David J. Abraham, Telikepalli Kavitha:
Voting Paths. 520-537 - R. Ravi, Amitabh Sinha:
Approximation Algorithms for Multicommodity Facility Location Problems. 538-551 - Agnieszka Görlich, Andrzej Zak:
On Packable Digraphs. 552-557 - Colin Cooper, Alan M. Frieze, Michael Krivelevich:
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. 558-569 - Aviezri S. Fraenkel:
Complementary Iterated Floor Words and the Flora Game. 570-588 - Jong Yoon Hyun:
A Subgroup of the Full Poset-Isometry Group. 589-599 - Peter Borg:
Cross-Intersecting Families of Partial Permutations. 600-608 - Oren Weimann, Raphael Yuster:
Computing the Girth of a Planar Graph in O(n logn) Time. 609-616 - Hung-Min Sun, Huaxiong Wang, Bying-He Ku, Josef Pieprzyk:
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time. 617-638 - Mindaugas Bloznelis:
Component Evolution in General Random Intersection Graphs. 639-654 - Ivan Soprunov, Jenya Soprunova:
Bringing Toric Codes to the Next Dimension. 655-665 - Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa:
Edge-Injective and Edge-Surjective Vertex Labellings. 666-683 - Brian D. O. Anderson, Iman Shames, Guoqiang Mao, Baris Fidan:
Formal Theory of Noisy Sensor Network Localization. 684-698 - Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni:
The Last Fraction of a Fractional Conjecture. 699-707
Volume 24, Number 3, 2010
- Demetres Christofides, Peter Keevash, Daniela Kühn, Deryk Osthus:
A Semiexact Degree Condition for Hamilton Cycles in Digraphs. 709-756 - Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number. 757-769 - Henning Bruhn, Maya Stein:
t-Perfection Is Always Strong for Claw-Free Graphs. 770-781 - Uriel Feige:
On Optimal Strategies for a Hat Game on Graphs. 782-791 - Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada:
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. 792-807 - Randy Cogill, Cheng Peng:
A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs. 808-820 - Carmen Cortés, Clara I. Grima, Ferran Hurtado, Alberto Márquez, Francisco Santos, Jesus Valenzuela:
Transforming Triangulations on Nonplanar Surfaces. 821-840 - N. R. Aravind, C. R. Subramanian:
Bounds on Edge Colorings with Restrictions on the Union of Color Classes. 841-852 - Marco Di Summa, Laurence A. Wolsey:
Lot-Sizing with Stock Upper Bounds and Fixed Charges. 853-875 - Stephen Suen, Kevin P. Wagner:
Some Results for the Acceptance Urn Model. 876-891 - Noga Alon, Ohad N. Feldheim:
The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus. 892-894 - Andrew Beveridge:
Connectivity of Random Cubic Sum Graphs. 895-909 - Rom Pinchasi, Allan Pinkus:
Dominating Subsets under Projections. 910-920 - Petter Brändén:
Discrete Concavity and the Half-Plane Property. 921-933 - Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles. 934-945 - Alexander A. Razborov:
On 3-Hypergraphs with Forbidden 4-Vertex Configurations. 946-963 - Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
On Reverse-Free Codes and Permutations. 964-978 - Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination Game and an Imagination Strategy. 979-991 - Encarnación Algaba Durán, Jesús Mario Bilbao, Marco Slikker:
A Value for Games Restricted by Augmenting Systems. 992-1010 - József Balogh, Wojciech Samotij:
Almost All C4-Free Graphs Have Fewer than (1-epsilon), ex(n, C4) Edges. 1011-1018 - Satoshi Murai:
On Face Vectors of Barycentric Subdivisions of Manifolds. 1019-1037 - Tao Jiang, Oleg Pikhurko, Zelealem B. Yilma:
Set Systems without a Strong Simplex. 1038-1045 - Tom Bohman, Andrzej Dudek, Alan M. Frieze, Oleg Pikhurko:
Flips in Graphs. 1046-1055 - Arjen Stolk, Kees Joost Batenburg:
An Algebraic Framework for Discrete Tomography: Revealing the Structure of Dependencies. 1056-1079 - Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis:
The VPN Problem with Concave Costs. 1080-1090 - Robert Lukot'ka, Ján Mazák:
Cubic Graphs with Given Circular Chromatic Index. 1091-1103 - Alain Franc, M. Goulard, Nathalie Peyrard:
Chordal Graphs to Identify Graphical Model Solutions of Maximum of Entropy Under Constraints on Marginals. 1104-1116 - Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani:
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents. 1117-1136 - Penny E. Haxell, Gordon T. Wilfong:
On the Stable Paths Problem. 1137-1152 - Ngo Dac Tan:
3-Arc-Dominated Digraphs. 1153-1161 - Colin Cooper, Alan M. Frieze:
Random Walks with Look-Ahead in Scale-Free Random Graphs. 1162-1176 - Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski:
Vision-Based Pursuit-Evasion in a Grid. 1177-1204 - Benjamin Doerr, Mahmoud Fouz:
Hereditary Discrepancies in Different Numbers of Colors II. 1205-1213
Volume 24, Number 4, 2010
- Julia Böttcher, Peter Heinig, Anusch Taraz:
Embedding into Bipartite Graphs. 1215-1233 - Zihui Liu, Jie Wang, Xin-Wen Wu:
On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes. 1234-1241 - Linyuan Lu, Yiting Yang:
A Lower Bound on the Transposition Diameter. 1242-1249 - Stefan Forcey, Aaron Lauve, Frank Sottile:
Hopf Structures on the Multiplihedra. 1250-1271 - William Y. C. Chen, Andrew Y. Z. Wang, Catherine H. Yan, Alina F. Y. Zhao:
Mixed Statistics on 01-Fillings of Moon Polyominoes. 1272-1290 - Bernd Schulze:
Symmetry as a Sufficient Condition for a Finite Flex. 1291-1312 - Jacob Fox:
Complete Minors and Independence Number. 1313-1321 - Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou:
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. 1322-1335 - Michael A. Henning, Anders Yeo:
Strong Transversals in Hypergraphs and Double Total Domination in Graphs. 1336-1355 - Nicholas A. Loehr:
Abacus Proofs of Schur Function Identities. 1356-1370 - Erez Louidor:
The Tradeoff Function for a Class of $\mathrm{RLL}(d, k)$ Constraints. 1371-1398 - Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein:
Combinatorics and Geometry of Finite and Infinite Squaregraphs. 1399-1440 - Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. 1441-1469 - Suil O, Sebastian M. Cioaba:
Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs. 1470-1481 - Wei-Tian Li, Linyuan Lu, Yiting Yang:
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes. 1482-1494 - Michael Krivelevich:
Embedding Spanning Trees in Random Graphs. 1495-1500 - Anna Adamaszek, Michal Adamaszek:
Large-Girth Roots of Graphs. 1501-1514 - Zhishi Pan, Xuding Zhu:
Multiple Coloring of Cone Graphs. 1515-1526 - Yusuke Suzuki:
Re-embeddings of Maximum 1-Planar Graphs. 1527-1540 - Walid Ben-Ameur, Makhlouf Hadji:
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem. 1541-1557 - Filippo Colomo, Andrei G. Pronko:
The Limit Shape of Large Alternating Sign Matrices. 1558-1571 - Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu:
Equitable Coloring of Sparse Planar Graphs. 1572-1583 - Maya Stein:
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs. 1584-1596 - Shinya Fujita, Henry Liu:
The Balanced Decomposition Number and Vertex Connectivity. 1597-1616 - Max A. Alekseyev:
On the Number of Two-Dimensional Threshold Functions. 1617-1631 - David R. Wood, Svante Linusson:
Thomassen's Choosability Argument Revisited. 1632-1637 - David Hartvigsen:
Neighbor Systems and the Greedy Algorithm. 1638-1661 - Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. 1662-1683 - Nets Hawk Katz, Paul Koester:
On Additive Doubling and Energy. 1684-1693 - Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding Time of Edge-Markovian Evolving Graphs. 1694-1712 - Sergio Cabello, Günter Rote:
Obnoxious Centers in Graphs. 1713-1730 - Paul Wollan:
Bridges in Highly Connected Graphs. 1731-1741 - Joseph E. Bonin:
A Construction of Infinite Sets of Intertwines for Pairs of Matroids. 1742-1752 - Ömer Egecioglu:
Bessel Polynomials and the Partial Sums of the Exponential Series. 1753-1762
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-02-21 19:37 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:
