 | 2010 |
|---|
| 12 |       | Tommy R. Jensen:
Graphs.
Encyclopedia of Machine Learning 2010: 479-482 |
| 11 | | Tommy R. Jensen:
Splits of circuits.
Discrete Mathematics 310(21): 3026-3029 (2010) |
| 2009 |
|---|
| 10 | | Enrique García Moreno Esteva,
Tommy R. Jensen:
A note on semiextensions of stable circuits.
Discrete Mathematics 309(15): 4952-4954 (2009) |
| 2007 |
|---|
| 9 | | Enrique García Moreno Esteva,
Tommy R. Jensen:
On semiextensions and circuit double covers.
J. Comb. Theory, Ser. B 97(3): 474-482 (2007) |
| 2006 |
|---|
| 8 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
On-line bin Packing with Two Item Sizes.
Algorithmic Operations Research 1(2): (2006) |
| 7 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Domination analysis for minimum multiprocessor scheduling.
Discrete Applied Mathematics 154(18): 2613-2619 (2006) |
| 6 | | Jinfeng Feng,
Hans-Erik Giesen,
Yubao Guo,
Gregory Gutin,
Tommy R. Jensen,
Arash Rafiey:
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
Journal of Graph Theory 53(4): 333-346 (2006) |
| 2005 |
|---|
| 5 |  | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Optimal On-Line Bin Packing with Two Item Sizes.
ACiD 2005: 95-103 |
| 4 | | Gregory Gutin,
Tommy R. Jensen,
Anders Yeo:
Batched bin packing.
Discrete Optimization 2(1): 71-82 (2005) |
| 2002 |
|---|
| 3 | | Tommy R. Jensen:
Dense critical and vertex-critical graphs.
Discrete Mathematics 258(1-3): 63-84 (2002) |
| 2001 |
|---|
| 2 | | Tommy R. Jensen,
Bjarne Toft:
25 Pretty graph colouring problems.
Discrete Mathematics 229(1-3): 167-169 (2001) |
| 1999 |
|---|
| 1 | | Reinhard Diestel,
Tommy R. Jensen,
Konstantin Yu. Gorbunov,
Carsten Thomassen:
Highly Connected Sets and the Excluded Grid Theorem.
J. Comb. Theory, Ser. B 75(1): 61-73 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page