Daniel M. Martin

Generating author description...

All published works

Action	Title	Year	Authors
+	The number of independent sets in bipartite graphs and benzenoids	2024	Michael Han Sycamore Herlihy Kirsti Kuenzel Daniel M. Martin Rachel Schmidt
+ PDF Chat	Tool wear segmentation in blanking processes with fully convolutional networks based digital image processing	2023	Clemens Schlegel Dirk Alexander Molitor Christian Kubik Daniel M. Martin Peter Groche
+	Connectivity of Markoff mod-p graphs and maximal divisors	2023	Jillian Eddy Elena Fuchs Matthew Litman Daniel M. Martin Nico Tripeny
+	Tool Wear Segmentation in Blanking Processes with Fully Convolutional Networks based Digital Image Processing	2023	Clemens Schlegel Dirk Alexander Molitor Christian Kubik Daniel M. Martin Peter Groche
+	The number of independent sets in bipartite graphs and benzenoids	2023	Michael Han Sycamore Herlihy Kirsti Kuenzel Daniel M. Martin Rachel Schmidt
+	Monochromatic Subgraphs in the Absence of a Properly Colored 4-Cycle	2018	Colton Magnant Daniel M. Martin Pouria Salehi Nowbandegani
+	An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions	2014	Domingos Dellamonica Subrahmanyam Kalyanasundaram Daniel M. Martin Vojtěch Rödl A. Shapira
+	Intersecting longest paths	2013	Susanna F. de Rezende Cristina G. Fernandes Daniel M. Martin Yoshiko Wakabayashi
+	The maximum agreement subtree problem	2013	Daniel M. Martin Bhalchandra D. Thatte
+	On Distance Between Graphs	2012	Alexander Halperin Colton Magnant Daniel M. Martin
+ PDF Chat	A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma	2012	Domingos Dellamonica Subrahmanyam Kalyanasundaram Daniel M. Martin Vojtěch Rödl A. Shapira
+	The maximum agreement subtree problem	2012	Daniel M. Martin Bhalchandra D. Thatte
+	Intersection of Longest Paths in a Graph	2011	Susanna F. de Rezende Cristina G. Fernandes Daniel M. Martin Yoshiko Wakabayashi
+ PDF Chat	A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma	2011	Domingos Dellamonica Subrahmanyam Kalyanasundaram Daniel M. Martin Vojtěch Rödl A. Shapira
+	On a conjecture of Thomassen concerning subgraphs of large girth	2010	Domingos Dellamonica Vácłav Koubek Daniel M. Martin Vojtěch Rödl
+	Rainbow paths	2009	Domingos Dellamonica Colton Magnant Daniel M. Martin
+	An asymptotic version of a conjecture by Enomoto and Ota	2009	Colton Magnant Daniel M. Martin
+	Note on asymptotically good packings	2009	Daniel M. Martin Vojtěch Rödl
+	A note on the path cover number of regular graphs	2009	Colton Magnant Daniel M. Martin

Common Coauthors

Coauthor	Papers Together
Vojtěch Rödl	5
Domingos Dellamonica	5
Colton Magnant	5
A. Shapira	3
Subrahmanyam Kalyanasundaram	3
Sycamore Herlihy	2
Yoshiko Wakabayashi	2
Bhalchandra D. Thatte	2
Clemens Schlegel	2
Michael Han	2
Cristina G. Fernandes	2
Rachel Schmidt	2
Christian Kubik	2
Kirsti Kuenzel	2
Dirk Alexander Molitor	2
Peter Groche	2
Susanna F. de Rezende	2
Nico Tripeny	1
Alexander Halperin	1
Jillian Eddy	1
Elena Fuchs	1
Vácłav Koubek	1
Matthew Litman	1
Pouria Salehi Nowbandegani	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Matrix multiplication via arithmetic progressions	1990	Don Coppersmith S. Winograd	3
+	A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph	1995	Richard A. Duke Hanno Lefmann V. Rödl	3
+ PDF Chat	The Algorithmic Aspects of the Regularity Lemma	1994	Noga Alon Richard A. Duke Hanno Lefmann V. Rödl Raphael Yuster	3
+	Lower bounds of tower type for Szemerédi's uniformity lemma	1997	W. T. Gowers	3
+	Quick Approximation to Matrices and Applications	1999	Alan Frieze Ravi Kannan	3
+	An Optimal Algorithm for Checking Regularity	2003	Yoshiharu Kohayakawa V. Rödl Luboš Thoma	3
+	Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs	2006	W. T. Gowers	2
+ PDF Chat	Eigenvalues and expanders	1986	Ilan Alon	2
+ PDF Chat	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi	2
+ PDF Chat	WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?	2009	Maria Axenovich	2
+ PDF Chat	Szemerédi’s Lemma for the Analyst	2007	László Lovász Balázs Szegedy	2
+	Regularity Lemmas for Graphs	2010	Vojtěch Rödl Mathias Schacht	2
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi	2
+ PDF Chat	Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start	1992	J. Kuczyński H. Woźniakowski	2
+	Extremal hexagonal chains	1993	Iván Gutman	1
+	Gallai–Ramsey numbers for cycles	2009	Shinya Fujita Colton Magnant	1
+ PDF Chat	On the difference between the maximum multiplicity and path cover number for tree-like graphs	2004	Francesco Barioli Shaun Fallat Leslie Hogben	1
+	Bipartite graphs can have any number of independent sets	1989	Václav Linek	1
+	An Entropy Approach to the Hard-Core Model on Bipartite Graphs	2001	Jeff Kahn	1
+	New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help	2000	Van H. Vu	1
+	Computation of minimal rank and path cover number for certain graphs	2004	Francesco Barioli Shaun Fallat Leslie Hogben	1
+ PDF Chat	On the difference between consecutive primes	1979	D. R. Heath‐Brown Henryk Iwaniec	1
+ PDF Chat	A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma	2012	Domingos Dellamonica Subrahmanyam Kalyanasundaram Daniel M. Martin Vojtěch Rödl A. Shapira	1
+	Graph similarity and distance in graphs	1998	Gary Chartrand Grzegorz Kubicki Michelle Schultz	1
+	Dense Graphs without 3-Regular Subgraphs	1995	L. Pyber V. Rödl Endre Szemerédi	1
+	None	2009	F Boesch Daniel Gross John T. Saccoman L. William Kazmierczak C Suffel Antonius Suhartomo	1
+	Rainbow Generalizations of Ramsey Theory: A Survey	2010	Shinya Fujita Colton Magnant Kenta Ozeki	1
+	Every Graph of Sufficiently Large Average Degree Contains a C 4 -Free Subgraph of Large Average Degree	2004	Daniela K�hn Deryk Osthus	1
+	Asymptotic behavior of the chromatic index for hypergraphs	1989	Nicholas Pippenger Joel Spencer	1
+	Asymptotically Optimal Covering Designs	1996	Daniel M. Gordon Oren Patashnik Greg Kuperberg Joel Spencer	1
+	Independent sets in regular graphs and sum-free subsets of finite groups	1991	Noga Alon	1
+	Partial cubes are distance graphs	2007	Melita Gorše Pihler Janez Žerovnik	1
+	Planar and infinite hypohamiltonian and hypotraceable graphs	1976	Carsten Thomassen	1
+	Girth in graphs	1983	Carsten Thomassen	1
+ PDF Chat	Estimating the largest eigenvalue of a positive definite matrix	1979	Dianne P. O’Leary G. W. Stewart James S. Vandergraft	1
+	Intersection of Longest Paths in a Graph	2011	Susanna F. de Rezende Cristina G. Fernandes Daniel M. Martin Yoshiko Wakabayashi	1
+	An El-Zahár type condition ensuring path-factors	1998	Robert Johansson	1
+ PDF Chat	The Inverse Problems for Some Topological Indices in Combinatorial Chemistry	2003	Xueliang Li Zimao Li Lusheng Wang	1
+	On a combinatorial problem in geometry	1975	H. L. Abbott D. Hanson	1
+	An improved bound on the maximum agreement subtree problem	2009	Mike Steel Łászló A. Székely	1
+	On the difference between asymptotically good packings and coverings	1995	N. N. Kuzjurin	1
+	On coloring graphs to maximize the proportion of multicolored k-edges	1968	Paul Erdős Daniel J. Kleitman	1
+	A homology theory for spanning tress of a graph	1977	László Lovász	1
+	Proper connection of graphs	2011	Valentin Borozan Shinya Fujita Aydin Gerek Colton Magnant Yannis Manoussakis Leandro Montero Źsolt Tuza	1
+	On finite set-systems whose every intersection is a Kernel of a star	1983	Zoltán Füredi	1
+	None	2004	Dan Archdeacon Joanna A. Ellis-Monaghan David Fisher Dalibor Fronček P. C. B. Lam Suzanne M. Seager Bing Wei Raphael Yuster	1
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey	1
+	Variations on the Gallai-Milgram theorem	1988	Irith Ben‐Arroyo Hartman	1
+	Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles	2013	Martin L. W. Hall Colton Magnant Kenta Ozeki Masao Tsugaki	1
+	Disconnected Colors in Generalized Gallai-Colorings	2012	Shinya Fujita András Gyárfás Colton Magnant Ákos Seress	1