Tomaž Pisanski

Publication List Details

Period

2004 - 2006

Number

19

Co-Authors

Pascal Workshop, Complex Objects Visualization 2005 - COV2005, Proceedings (2006)

Pisanski, Tomaž, Horvat, Boris, Žerovnik, Janez, Mladenić, Dunja, Grobelnik, Marko, Anžič, Tina, ...

Pascal workshop on Complex Object Visualization COV-2005 brought together a group of researchers from various branches of Mathematics and Computer Science focused around a common theme that arises in...

Counting Disconnected Structures: Chemical Trees, Fullerenes, I-graphs, and others (2005)

Petkovšek, Marko, Pisanski, Tomaž

When counting isomers with a given number of atoms one usually assumes that we want to count (connected) molecules. In this note we present a method that can be used for counting disconnected...

Representations of graphs (2005)

Pisanski, Tomaž

A graph is a mathematical structure that is sometimes hard to separate from its visualization. An important branch of graph theory studies graph drawing problems. Recently a mathematical approach to...

Visualizing Cauchy’s Interlacing Property for Line Distance Matrices (2005)

Pisanski, Tomaž, Jaklič, Gašper, Randič, Milan

In the paper it is proven that line distance matrices of size n have one positive and n − 1 negative eigenvalues. Visual representation of Cauchy’s interlacing property for line distance matrices...

Self-Adapting Architecture (SAA) (2005)

Pisanski, Tomaž, Orbanić, Alen, Jaklič, Gašper, Kavkler, Iztok, Boben, Marko

New tools and concepts for manipulation of objects in architecture are presented. The concepts include manipulation of local coordinate systems and objects contained in them, as well as performing...

On the Number of Hamiltonian Groups (2005)

Horvat, Boris, Jaklič, Gašper, Pisanski, Tomaž

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all...

On the number of hamiltonian groups (2005)

Pisanski, Tomaž, Horvat, Boris, Jaklic, Gašper

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order n all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to n all whose...

On a taxi routing problem. (2004)

Horvat, Boris, Orbanić, Alen, Pisanski, Tomaž, Jaklič, Gregor, Brodnik, Andrej

A variation of the Vehicle Routing Problem in which a fleet of taxi vehicles service demands for point-to-point customer transportation is introduced in this paper. A model that allows easy variation...

A voting problem based on European Union election system. (2004)

Horvat, Boris, Orbanić, Alen, Boben, Marko, Pisanski, Tomaž, Jaklič, Gregor

A generalization of the Qualified Majority Voting (QMV) system is presented in the paper. As a measure of a power of a voter, so called normalized Banzhaf index is used. A backtracking type algorithm...

The Eurosong center of a graph. (2004)

Horvat, Boris, Orbanić, Alen, Pisanski, Tomaž, Jaklič, Gregor

In the paper a new measure of a graph or network, the Eurosong center of a graph, is defined. Several voting strategies and their influence on the Eurosong center of a graph are studied. Different...

Graph Laplacians, nodal domains, and hyperplane arrangements. (2004)

Pisanski, Tomaž, BIYIKOGLU, Türker, HORDIJK, Wim, LEYDOLD, Josef, STADLER, Peter

Eigenvectors of the Laplacian of a graph $G$ have received increasing attention in the recent past. Here we investigate their so-called nodal domains, i.e., the connected components of the maximal...

Representations of graphs and maps. (2004)

Pisanski, Tomaž, Žitnik, Arjana

Several methods for representing (drawing) graphs are considered, which minimize different energies of representations. The idea of representations is generalized to maps. Some well-known operations...