Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 38
Volume 38, Number 1, March 2024
- Joseph Paat
, Ingo Stallknecht, Zach Walsh, Luze Xu:
On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices. 1-18 - Tony Huynh, O-joung Kwon:
On the Erdős-Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs. 19-42 - Raphael Yuster:
Packing and Covering a Given Directed Graph in a Directed Graph. 43-54 - Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Jonathan Rollin:
Ramsey Equivalence for Asymmetric Pairs of Graphs. 55-74 - Eva Fluck:
Tangles and Hierarchical Clustering. 75-92 - Abdulmajeed Alqasem, Heshan Aravinda, Arnaud Marsiglietti, James Melbourne:
On a Conjecture of Feige for Discrete Log-Concave Distributions. 93-102 - Dmitriy Kunisky, Cristopher Moore:
The Spectrum of the Grigoriev-Laurent Pseudomoments. 103-131 - Kristóf Bérczi, Tamás Schwarcz:
Exchange Distance of Basis Pairs in Split Matroids. 132-147 - Martin Hoefer, Kevin Schewior, Daniel Schmand:
Stochastic Probing with Increasing Precision. 148-169 - Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On Weighted Graph Separation Problems and Flow Augmentation. 170-189 - Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules in Robinson Spaces. 190-224 - Domagoj Bradac, Lior Gishboliner, Benny Sudakov:
On Ramsey Size-Linear Graphs and Related Questions. 225-242 - Tung H. Nguyen:
Highly Connected Subgraphs with Large Chromatic Number. 243-260 - Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev:
The Treewidth and Pathwidth of Graph Unions. 261-276 - Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. 277-315 - Hao Chen, Jie Ma:
A Property on Monochromatic Copies of Graphs Containing a Triangle. 316-326 - Yann Disser, David Weckbecker:
Unified Greedy Approximability beyond Submodular Maximization. 348-379 - Steven Kelk, Ruben Meuwese, Stephan Wagner:
Convex Characters, Algorithms, and Matchings. 380-411 - Yuval Filmus, Idan Mehalel:
Optimal Sets of Questions for Twenty Questions. 412-452 - Daniel Neuen:
Isomorphism Testing Parameterized by Genus and Beyond. 453-484 - Steffen Borgwardt, Weston Grewe, Jon Lee:
On the Combinatorial Diameters of Parallel and Series Connections. 485-503 - Dimitrios Los, Thomas Sauerwald, John Sylvester:
The Power of Filling in Balanced Allocations. 529-565 - Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou:
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs. 566-589 - Lele Liu:
Graph Limits and Spectral Extremal Problems for Graphs. 590-608 - Maria Axenovich, Hanno Lefmann:
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations. 609-628 - Sebastian Babinski, Andrzej Grzesik:
Graphs without a Rainbow Path of Length 3. 629-644 - Alex D. Scott, Paul D. Seymour, Sophie Theresa Spirkl:
Pure Pairs. IX. Transversal Trees. 645-667 - Brendan Nagle, John Theado:
Some Cubic Time Regularity Algorithms for Triple Systems. 668-701 - Sarah Miracle, Amanda Pascoe Streib:
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations. 702-725 - Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Bernoulli Factories for Flow-Based Polytopes. 726-742 - James Cruickshank, Fatemeh Mohammadi, Harshit J. Motwani, Anthony Nixon, Shin-ichi Tanigawa:
Global Rigidity of Line Constrained Frameworks. 743-763 - Yann Disser, Max Klimm, Annette Lutz, David Weckbecker:
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. 764-789 - Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. 790-827 - Pavol Hell, Jing Huang, Jephian C.-H. Lin:
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. 828-844 - Noga Alon, Emil Powierski, Michael Savery, Alex D. Scott, Elizabeth Wilmer:
Invertibility of Digraphs and Tournaments. 327-347 - Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Square Coloring Planar Graphs with Automatic Discharging. 504-528 - Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte:
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs. 845-856 - Marcin Brianski, Gwenaël Joret, Michal T. Seweryn:
Pathwidth Versus Cocircumference. 857-866 - Deepak Bal, Alan M. Frieze, Pawel Pralat:
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). 867-882 - Joshua Brakensiek, Sami Davies:
Robust Factorizations and Colorings of Tensor Graphs. 883-916 - Yen-Jen Cheng, Sen-Peng Eu, Tung-Shan Fu, Jyun-Cheng Yao:
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions. 917-946 - Catherine Babecki, David Shiroma:
Eigenpolytope Universality and Graphical Designs. 947-964 - Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood:
Treewidth, Circle Graphs, and Circular Drawings. 965-987 - Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
On the Concentration of the Maximum Degree in the Duplication-Divergence Models. 988-1006 - Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond. 1007-1029 - Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. 1030-1056 - Robert Hickingbotham, David R. Wood:
Shallow Minors, Graph Products, and Beyond-Planar Graphs. 1057-1089 - Debsoumya Chakraborti, Kevin Hendrey, Ben Lund, Casey Tompkins:
Rainbow Saturation for Complete Graphs. 1090-1112 - Pakawut Jiradilok, Supanat Kamtue:
Transportation Distance between Probability Measures on the Infinite Regular Tree. 1113-1157
a service of 
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 2024-04-26 18:24 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:
