Level planar embedding in linear time.
Jünger, Michael, Leipert, Sebastian (2002)
Journal of Graph Algorithms and Applications
Similarity:
Jünger, Michael, Leipert, Sebastian (2002)
Journal of Graph Algorithms and Applications
Similarity:
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
Similarity:
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Bachmaier, Christian, Brandenburg, Franz J., Forster, Michael (2005)
Journal of Graph Algorithms and Applications
Similarity:
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Kathie Cameron, Jack Edmonds (1999)
Annales de l'institut Fourier
Similarity:
Vertex-degree parity in large implicit “exchange graphs” implies some EP theorems asserting the existence of a second object without evidently providing a polytime algorithm for finding a second object.
Didimo, Walter, Pizzonia, Maurizio (2003)
Journal of Graph Algorithms and Applications
Similarity:
Cabello, Sergio, Van Kreveld, Marc, Liotta, Giuseppe, Meijer, Henk, Speckmann, Bettina, Verbeek, Kevin (2011)
Journal of Graph Algorithms and Applications
Similarity:
Bhosle, Amit M., Gonzalez, Teofilo F. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity: