Find link

language:

Find link is a tool written by Edward Betts.

searching for Discrete Mathematics & Theoretical Computer Science 26 found (38 total)

alternate case: discrete Mathematics & Theoretical Computer Science

Eric Goles (165 words) [view diff] no match in snippet view article find links to article

University of Grenoble in France. His research focuses on discrete mathematics, theoretical computer science, complex systems, and cellular automata. Goles is

Queue number (2,715 words) [view diff] exact match in snippet view article find links to article

David R. (2004), "Track layouts of graphs" (PDF), Discrete Mathematics & Theoretical Computer Science, 6 (2): 497–521, arXiv:cs/0407033, Bibcode:2004cs

King's graph (647 words) [view diff] exact match in snippet view article find links to article

Algorithms, Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341

Outline of combinatorics (683 words) [view diff] exact match in snippet view article find links to article

Discrete Applied Mathematics Discrete Mathematics Discrete Mathematics & Theoretical Computer Science Discrete Optimization Discussiones Mathematicae Graph

Connected dominating set (1,239 words) [view diff] exact match in snippet view article find links to article

a k-leaf spanning tree in an undirected graph", Discrete Mathematics & Theoretical Computer Science, 16 (1): 179–200, MR 3188035. Fellows, Michael R

Road coloring theorem (676 words) [view diff] exact match in snippet view article find links to article

coloring conjecture", Proc. EuroComb 2005 (PDF), Discrete Mathematics & Theoretical Computer Science, pp. 279–284. Kari, Jarkko (2003), "Synchronizing

Cop-win graph (3,239 words) [view diff] exact match in snippet view article find links to article

Algorithms, Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341

International Conference on Formal Power Series and Algebraic Combinatorics (363 words) [view diff] exact match in snippet view article find links to article

Series and Algebraic Combinatorics (FPSAC 2014)". Discrete Mathematics & Theoretical Computer Science Proceedings. AT. "Proceedings of the 35th International

Enumeration algorithm (1,189 words) [view diff] exact match in snippet view article find links to article

Enumeration of Solutions Produced by Closure Operations". Discrete Mathematics & Theoretical Computer Science. 21 (3). arXiv:1712.03714. doi:10.23638/DMTCS-21-3-22

Klam value (939 words) [view diff] exact match in snippet view article find links to article

analysis for finding a k-leaf spanning tree in an undirected graph", Discrete Mathematics & Theoretical Computer Science, 16 (1): 179–200, MR 3188035.

Cycle rank (1,221 words) [view diff] exact match in snippet view article find links to article

and Applications in Formal Language Theory" (PDF), Discrete Mathematics & Theoretical Computer Science, 14 (2): 189–204. Gruber, Hermann; Holzer, Markus

AofA—International Meeting on Combinatorial, Probabilistic, and Asymptotic Methods in the Analysis of Algorithms (923 words) [view diff] exact match in snippet view article find links to article

Loved - AofA 2014 Lecture by Don Knuth" (PDF). "Discrete Mathematics & Theoretical Computer Science - DMTCS Proceedings vol. AI, Fifth Colloquium on

Endre Szemerédi (1,507 words) [view diff] no match in snippet view article find links to article

published over 200 scientific articles in the fields of discrete mathematics, theoretical computer science, arithmetic combinatorics and discrete geometry. He

Faro shuffle (1,498 words) [view diff] exact match in snippet view article find links to article

the Multiway Perfect Shuffle Permutation" (PDF). Discrete Mathematics & Theoretical Computer Science. 5: 169–180. doi:10.46298/dmtcs.308. Retrieved 26

Graphs with few cliques (963 words) [view diff] exact match in snippet view article find links to article

Complexity results on graphs with few cliques. Discrete Mathematics & Theoretical Computer Science, Vol. 9 no. 1 (Graph and Algorithms), 387. https://doi

Tuza's conjecture (809 words) [view diff] exact match in snippet view article find links to article

(2022), "Tuza's conjecture for threshold graphs", Discrete Mathematics & Theoretical Computer Science, 24 (1): P24:1–P24:14, arXiv:2105.09871, doi:10.46298/dmtcs

Grundy number (1,355 words) [view diff] exact match in snippet view article find links to article

lower bound for approximating Grundy numbering", Discrete Mathematics & Theoretical Computer Science, 9 (1). Bonnet, Édouard; Foucaud, Florent; Kim, Eun

Succinct game (1,887 words) [view diff] no match in snippet view article find links to article

Classification of Interactive Complexity Classes. Certer for Discrete Mathematics \& Theoretical Computer Science. Retrieved 2010-01-25. Fortnow, Lance; Impagliazzo

Interval graph (2,640 words) [view diff] exact match in snippet view article find links to article

"Classes of graphs with restricted interval models", Discrete Mathematics & Theoretical Computer Science, 3 (4): 167–176, CiteSeerX 10.1.1.39.9532 Roberts

Discrete mathematics (2,771 words) [view diff] no match in snippet view article find links to article

Fulkerson Prize is awarded for outstanding papers in discrete mathematics. Theoretical computer science includes areas of discrete mathematics relevant to

Apéry's constant (3,021 words) [view diff] exact match in snippet view article find links to article

some classical constants by the Markov-WZ method", Discrete Mathematics & Theoretical Computer Science, 7: 11–24, doi:10.46298/dmtcs.342. Mollin, Richard

Garden of Eden (cellular automaton) (3,537 words) [view diff] exact match in snippet view article

cellular automata far from the Garden of Eden", Discrete Mathematics & Theoretical Computer Science, 15 (3): 41–60, MR 3141826 Ceccherini-Silberstein

Permutation pattern (4,037 words) [view diff] exact match in snippet view article find links to article

for 321-avoiding and skew-merged permutations", Discrete Mathematics & Theoretical Computer Science, 18 (2), arXiv:1510.06051, doi:10.46298/dmtcs.1308

Twin-width (4,053 words) [view diff] exact match in snippet view article find links to article

2023), "Bounds on the twin-width of product graphs", Discrete Mathematics & Theoretical Computer Science, 25 (1), arXiv:2202.11556, doi:10.46298/dmtcs.10091

List of Stuyvesant High School people (6,910 words) [view diff] no match in snippet view article find links to article

orchestras (Harvard University) Dana Randall (1984) – discrete mathematics, theoretical computer science (Georgia Tech) Elizabeth Wilmer (1987) – Markov chains

Book embedding (8,167 words) [view diff] exact match in snippet view article find links to article

David R. (2004), "On linear layouts of graphs", Discrete Mathematics & Theoretical Computer Science, 6 (2): 339–357, MR 2081479. Wigderson, Avi (February