Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity von Bienvenu, Meghyn, Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir V., Zakharyaschev, Michael

Volltext

On the Decision Tree Complexity of Threshold Functions von Chistopolskaya, Anastasiya, Podolskii, Vladimir V.

Volltext

Tropical Effective Primary and Dual Nullstellensätze von Grigoriev, Dima, Podolskii, Vladimir V.

Volltext

Tropical Combinatorial Nullstellensatz and Sparse Polynomials von Grigoriev, Dima, Podolskii, Vladimir V.

Volltext

Bounds in Ontology-Based Data Access via Circuit Complexity von Podolskii, Vladimir V.

Volltext

Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates von Kulikov, Alexander S., Podolskii, Vladimir V.

Volltext

Complexity of Tropical and Min-plus Linear Prevarieties von Grigoriev, Dima, Podolskii, Vladimir V.

Volltext

MAX-CUT ABOVE SPANNING TREE is Fixed-Parameter Tractable von Madathil, Jayakrishnan, Saurabh, Saket, Zehavi, Meirav

Volltext

CSR 2018 Special Issue on TOCS von Fomin, Fedor V., Podolskii, Vladimir V.

Volltext

Organizational features of detection of secondary metachronic primary multiple colorectal cancer in a group of patients with extracolorectal malignancies von Podolskii, Vladimir V., Stanoevich, Uglesha, Podolskaya, Elena A.

Volltext

Exponential lower bound for bounded depth circuits with few threshold gates von Podolskii, Vladimir V.

Volltext

Maximum Colorful Cycles in Vertex-Colored Graphs von Italiano, Giuseppe F., Manoussakis, Yannis, Kim Thang, Nguyen, Pham, Hong Phong

Volltext

The Clever Shopper Problem von Bulteau, Laurent, Hermelin, Danny, Labarre, Anthony, Vialette, Stéphane

Volltext

A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning von Podolskii, Vladimir E., Staroverov, Vladimir M., Pankratieva, Vera V., Nersisyan, Stepan A.

Volltext

Complexity Aspects of the Extension of Wagner's Hierarchy to k-Partitions von Podolskii, Vladimir, Selivanov, Victor

Volltext

On Strong NP-Completeness of Rational Problems von Wojtczak, Dominik

Volltext

Computer Science – Theory and Applications: 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings

Volltext

Can We Create Large k-Cores by Adding Few Edges? von Chitnis, Rajesh, Talmon, Nimrod

Volltext

Instrumental Mechanoreceptoric Palpation in Gastrointestinal Surgery von Podolskii, Vladimir E., Andreytsev, Igor L., Shapovalyants, Sergey G., Nakashidze, Eldar R., Galatenko, Vladimir, Solodova, Rozaliia F., Sokolov, Mikhail E.

Volltext

Patience of matrix games von Hansen, Kristoffer Arnsfelt, Ibsen-Jensen, Rasmus, Podolskii, Vladimir V., Tsigaridas, Elias

Volltext