Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Jacobson, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A degree sequence variant of graph Ramsey numbers
Arthur Busch
,
Michael Ferrara
,
Stephen G. Hartke
,
Michael Jacobson
Graphs and Combinatorics
30
(4), 2014, pp. 847-859
Degree conditions for spanning brooms
Guantao Chen
,
Michael Ferrara
,
Zhiquan Hu
,
Michael Jacobson
,
Huiqing Liu
Journal of Graph Theory
77
(3), 2014, pp. 237-250
Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
Arthur H. Busch
,
Michael S. Jacobson
,
Timothy Morris
,
Michael J. Plantholt
,
Shailesh K. Tipnis
Graphs and Combinatorics
29
(3), 2013, pp. 359-364
Packing of graphic
n
-tuples
Arthur H. Busch
,
Michael J. Ferrara
,
Stephen G. Hartke
,
Michael S. Jacobson
,
Hemanshu Kaul
,
Douglas B. West
Journal of Graph Theory
70
(1), 2012, pp. 29-39
Distributing vertices on Hamiltonian cycles
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Colton Magnant
Journal of Graph Theory
69
(1), 2012, pp. 28-45
New ore-type conditions for
H
-linked graphs
Michael Ferrara
,
Ronald Gould
,
Michael Jacobson
,
Florian Pfender
,
Jeffrey Powell
,
Thor Whalen
Journal of Graph Theory
71
(1), 2012, pp. 69-77
Saturation numbers for families of graph subdivisions
Michael Ferrara
,
Michael Jacobson
,
Kevin G. Milans
,
Craig Tennenhouse
,
Paul S. Wenger
Journal of Graph Theory
71
(4), 2012, pp. 416-434
Practical improvements to class group and regulator computation of real quadratic fields
Jean-François Biasse
,
Michael J., Jr. Jacobson
Lecture Notes in Computer Science
6197
, 2010, pp. 50-65
Transitive partitions in realizations of tournament score sequences
Arthur H. Busch
,
Guantao Chen
,
Michael S. Jacobson
Journal of Graph Theory
64
(1), 2010, pp. 52-62
Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
Michael Ferrara
,
Michael S. Jacobson
,
Angela Harris
Graphs and Combinatorics
26
(2), 2010, pp. 215-223
On arc-traceable tournaments
Arthur H. Busch
,
Michael S. Jacobson
,
K.B. Reid
Journal of Graph Theory
53
(2), 2006, pp. 157-166
Cycle extendability of Hamiltonian interval graphs
Guantao Chen
,
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 682-689
Numerical results on class groups of imaginary quadratic fields
Michael J., Jr. Jacobson
,
Shantha Ramachandran
,
Hugh Williams
Lecture Notes in Computer Science
4076
, 2006, pp. 87-101
Minimal degree and
(k, m)
-pancyclic ordered graphs
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Graphs and Combinatorics
21
(2), 2005, pp. 197-211
The bar visibility number of a graph
Yi-Wu Chang
,
Joan P. Hutchinson
,
Michael S. Jacobson
,
Jenŏ Lehel
,
Douglas B. West
SIAM Journal on Discrete Mathematics
18
(3), 2004-2005, pp. 462-471
Generalizing pancyclic and
k
-ordered graphs
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Graphs and Combinatorics
20
(3), 2004, pp. 291-309
Fragile graphs with small independent cuts
Guantao Chen
,
Ralph J. Faudree
,
Michael S. Jacobson
Journal of Graph Theory
41
(4), 2002, pp. 327-341
Computational aspects of NUCOMP
Michael J., Jr. Jacobson
,
Alfred J. van der Poorten
Lecture Notes in Computer Science
2369
, 2002, pp. 120-133
Algorithms for large integer matrix problems
Mark Giesbrecht
,
Michael, Jr. Jacobson
,
Arne Storjohann
Lecture Notes in Computer Science
2227
, 2001, pp. 297-307
Cycles in 2-factors of balanced bipartite graphs
Guantao Chen
,
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Graphs and Combinatorics
16
(1), 2000, pp. 67-80
On
k
-ordered graphs
Jill R. Faudree
,
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Journal of Graph Theory
35
(2), 2000, pp. 69-82
Even cycles in graphs with many odd cycles
Ralph J. Faudree
,
Evelyne Flandrin
,
Michael S. Jacobson
,
Jenö Lehel
,
Richard H. Schelp
Graphs and Combinatorics
16
(4), 2000, pp. 399-410
Tough enough chordal graphs are Hamiltonian
Guantao Chen
,
Michael S. Jacobson
,
André E. Kézdy
,
Jenŏ Lehel
Networks
31
(1), 1998, pp. 29-38
Note on graphs without repeated cycle lengths
Guantao Chen
,
Jenö Lehel
,
Michael S. Jacobson
,
Warren E. Shreve
Journal of Graph Theory
29
(1), 1998, pp. 11-15
Recognizing triangle-free graphs with induced path-cycle double covers is
NP
-complete
Michael S. Jacobson
,
André E. Kézdy
,
Jenŏ Lehel
Networks
31
(1), 1998, pp. 1-10
Seiten 1
2
>