- 49 (1): 31–33. doi:10.1111/j.2044-8295.1958.tb00634.x. PMID 13536303.
Kirousis,
Lefteris M.; Papadimitriou,
Christos H. (1985). "The
complexity of recognizing...
-
structure Cereceda's
conjecture Bader &
Hogue (2003).
Freuder (1982).
Kirousis &
Thilikos (1996). Erdős &
Hajnal (1966).
Irani (1994).
Matula & Beck (1983)...
-
rather than by
factoring out the parti****tion of the women. However,
Kirousis &
Kontogeorgiou (2018)
found the even more
straightforward ladies-first...
- 49 (1): 31–33. doi:10.1111/j.2044-8295.1958.tb00634.x. PMID 13536303.
Kirousis,
Lefteris M.; Papadimitriou,
Christos H. (1985). "The
complexity of recognizing...
- 1109/INFCOM.2005.1498534, ISBN 0-7803-8968-9, S2CID 8085139. Giotis, I.;
Kirousis, L.; Psaromiligkos, K. I.; Thilikos, D. M. (2015), "On the algorithmic...
-
Theoretical Computer Science. 399 (3): 236–245. doi:10.1016/j.tcs.2008.02.040.
Kirousis, M.; Papadimitriou, C. (1986). "Searching and pebbling".
Theoretical Computer...
- the
fugitive can be
guaranteed to be caught, no
matter how he moves. As
Kirousis &
Papadimitriou (1985) show, the node
searching number of a
graph equals...
