Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 20
Volume 20, Number 1, 2018
- David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Paths Embeddings in ℝd. - Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. - Yury Kartynnik, Andrew Ryzhikov:
On Minimum Maximal Distance-k Matchings. - Christopher Duffy
, Thomas F. Lidbetter, Margaret-Ellen Messinger, Richard J. Nowakowski:
A Variation on Chip-Firing: the diffusion game. - Jean-Florent Raymond:
Hitting minors, subdivisions, and immersions in tournaments. - Christopher Duffy, Gary MacGillivray, Éric Sopena:
A Study of k-dipath Colourings of Oriented Graphs. - Dömötör Pálvölgyi:
Weak embeddings of posets to the Boolean lattice. - Katarzyna Rybarczyk:
Finding Hamilton cycles in random intersection graphs. - Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
On subtrees of the representation tree in rational base numeration systems. - Benjamin Hackl, Helmut Prodinger:
Growing and Destroying Catalan-Stanley Trees. - Hamid Kameli:
Non-adaptive Group Testing on Graphs. - Mehri Javanian:
Protected node profile of Tries. - Júlio Araújo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan:
On interval number in cycle convexity. - Valentin Garnero, Ignasi Sau:
A Linear Kernel for Planar Total Dominating Set. - Michael D. Barrus:
Weakly threshold graphs. - Grace Misereh, Yuri Nikolayevsky:
Annular and pants thrackles. - Jessica Striker:
Rowmotion and generalized toggle groups. - John Haslegrave:
Proof of a local antimagic conjecture. - Michitaka Furuya:
Forbidden subgraphs for constant domination number. - Adam Borchert, Narad Rampersad:
Permutation complexity of images of Sturmian words by marked morphisms. - Kasper Szabo Lyngsie:
On neighbour sum-distinguishing {0,1}-edge-weightings of bipartite graphs. - Melissa S. Keranen, Juho Lauri:
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs. - Selim Bahadir, Didem Gözüpek:
On a Class of Graphs with Large Total Domination Number. - Brian Cloteaux:
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum. - Sylwia Cichacz, Jakub Przybylo:
Group twin coloring of graphs. - Zoltán Fülöp, Luisa Herrmann, Heiko Vogler:
Weighted Regular Tree Grammars with Storage.
Volume 20, Number 2, 2018
- Timothy Highley, Hoang Le:
Tropical Vertex-Disjoint Cycles of a Vertex-Colored Digraph: Barter Exchange with Multiple Items Per Agent. - M. Rajaati, Mohammad Reza Hooshmandasl, Michael J. Dinneen, Ali Shakiba:
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. - Robert A. Proctor, Matthew J. Willis:
Convexity of tableau sets for type A Demazure characters (key polynomials), parabolic Catalan numbers. - Zhuang Wei, Guoliang Hao:
Semitotal domination in trees. - Mirjana Mikalacki, Milos Stojakovic:
Fast strategies in biased Maker-Breaker games. - Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Wozniak:
On locally irregular decompositions and the 1-2 Conjecture in digraphs. - Yaping Mao, Eddie Cheng, Zhao Wang:
Steiner Distance in Product Networks. - Chuanan Wei, Lily Li Liu, Dianxuan Gong:
Summation formulas for Fox-Wright function. - Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. - Evan Chen, Shyam Narayanan:
The 26 Wilf-equivalence classes of length five quasi-consecutive patterns. - Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang:
Complexity of locally-injective homomorphisms to tournaments. - Burak Ekici:
IMP with exceptions over decorated logic. - José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas:
General bounds on limited broadcast domination. - Jean Cardinal, Vera Sacristán, Rodrigo I. Silveira:
A Note on Flips in Diagonal Rectangulations. - Fábio Protti, Uéverton S. Souza:
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs. - Hortensia Galeana-Sánchez, Mika Olsen:
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments. - Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
On Almost Well-Covered Graphs of Girth at Least 6. - Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
Sigma Partitioning: Complexity and Random Graphs.
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-06-10 21:25 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:
