University of West Bohemia in Pilsen

output

20042026

most citedSciPy 1.0--Fundamental Algorithms for Scientific Computing in Python

40.2k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2013Show all

14 papers · 1 filter

math.CO2013

The Ramsey numbers of paths versus wheels: a complete solution

Binlong Li, Bo Ning

Let $G_{1}$ and $G_{2}$ be two given graphs. The Ramsey number $R (G_{1}, G_{2})$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_{1}$ or $\ove…

math.NA2013★ 171 cited

An FFT-based Galerkin Method for Homogenization of Periodic Media

Jaroslav Vondřejc, Jan Zeman, Ivo Marek

In 1994, Moulinec and Suquet introduced an efficient technique for the numerical resolution of the cell problem arising in homogenization of periodic media. The scheme is based on…

math.CO2013★ 15 cited

Colouring quadrangulations of projective spaces

Tomáš Kaiser, Matěj Stehlík

A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G w…

cond-mat.mes-hall2013★ 19 cited

Skyrmion magnetic structure of an ordered FePt monolayer deposited on Pt(111)

S. Polesya, S. Mankovsky, S. Bornemann +3

The effect of the Dzyaloshinsky-Moriya interaction on the magnetic structure of an ordered FePt monolayer deposited on Pt (111) surface has been investigated. In the ground state,…

math.CO2013★ 4 cited

Flips in combinatorial pointed pseudo-triangulations with face degree at most four

Oswin Aichholzer, Thomas Hackl, David Orden +3

In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combin…

cs.CG2013

Terrain visibility with multiple viewpoints

Ferran Hurtado, Maarten Löffler, Inês Matos +4

We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider a triangulated terrain with $m > 1$ viewpoints (or guards) located on th…

physics.flu-dyn2013★ 404 cited

Experimental investigation of dynamic pressure loads during dam break

Libor Lobovský, Elkin Botia-Vera, Filippo Castellana +2

The objectives of this work are to revisit the experimental measurements on dam break flow over a dry horizontal bed and to provide a detailed insight into the dynamics of the dam…

math.CO2013★ 42 cited

Star edge coloring of some classes of graphs

Ľudmila Bezegová, Borut Lužar, Martina Mockovčiaková +2

\textit{A star edge coloring} of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this paper we establish tight upper bounds for trees and…

math.CO2013★ 8 cited

l-facial edge colorings of graphs

Borut Lužar, Martina Mockovčiaková, Roman Soták +2

An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance at most l on a boundary walk of some face receive distinct colors. It is c…

math.CO2013

The Packing Coloring of Distance Graphs $D (k, t)$

Jan Ekstein, Přemysl Holub, Olivier Togni

The packing chromatic number $χ_{ρ} (G)$ of a graph $G$ is the smallest integer $p$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{p}$ where vertic…

cs.DM2013★ 16 cited

FO Model Checking of Interval Graphs

Robert Ganian, Petr Hlineny, Daniel Kral +3

We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that…

cond-mat.mtrl-sci2013★ 105 cited

Mixed Dimensionality of Confined Conducting Electrons in the Surface Region of SrTiO $_{3}$

N. C. Plumb, M. Salluzzo, E. Razzoli +16

Using angle-resolved photoemission spectroscopy, we show that the recently-discovered surface state on SrTiO $_{3}$ consists of non-degenerate $t_{2 g}$ states with different dimensi…

cs.DS2013

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

Hajo Broersma, Jiří Fiala, Petr A. Golovach +3

Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval gr…

math.CO2013★ 48 cited

Replication in critical graphs and the persistence of monomial ideals

Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., cri…