Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
Alejandro Estrella-Balderrama, Elisabeth Gassner, ...
This paper presents a method for obtaining accurate dense elevation and appearance models of terrain using a single camera on-board an aerial platform. Applications of this method...
Christopher Geyer, Todd Templeton, Marci Meingast,...