Search Results - Lecture Notes in Computer Science

South African research contributions to Lecture Notes in Computer Science, 1973-2022 by Naude, Filistea, Kroeze, Jan H

“…Lecture Notes in Computer Science (LNCS) is a globally recognised publication outlet for the field of Computer Science, including in South Africa…”
Get full text

South African research contributions to Lecture Notes in Computer Science, 1973-2022 by Naudé, Filistéa, Kroeze, Jan H.

“…Lecture Notes in Computer Science (LNCS) is a globally recognised publication outlet for the field…”
Get full text

Thomas Piecha and Peter Schroeder-Heister. Incompleteness of Intuitionistic Propositional Logic with Respect to Proof-Theoretic Semantics . Studia Logica , vol. 107 (2019), no. 1, pp. 233–246. - Alexander V. Gheorghiu, Tao Gu and David J. Pym. Proof-Theoretic Semantics for Intuitionistic Multiplicative Linear Logic . Automated Reasoning with Analytic Tableaux and Related Methods, Revantha Ramanayake and Josef Urban, Lecture Notes in Computer Science, vol. 14278, Springer, Cham, pp. 367–385. - He by Stafford, Will

Get full text

New inapproximability bounds for TSP by Karpinski, Marek, Lampis, Michael, Schmied, Richard

“…In this paper, we study the approximability of the metric Traveling Salesman Problem (TSP) and prove new explicit inapproximability bounds for that problem…”
Get full text

Deep Voting: A Robust Approach Toward Nucleus Localization in Microscopy Images by Xie, Yuanpu, Kong, Xiangfei, Xing, Fuyong, Liu, Fujun, Su, Hai, Yang, Lin

“…Robust and accurate nuclei localization in microscopy image can provide crucial clues for accurate computer-aid diagnosis…”
Get more information

Simple odd β-cycle inequalities for binary polynomial optimization by Del Pia, Alberto, Walter, Matthias

“…We consider the multilinear polytope which arises naturally in binary polynomial optimization. Del Pia and Di Gregorio introduced the class of odd β -cycle…”
Get full text

Popular branchings and their dual certificates by Kavitha, Telikepalli, Király, Tamás, Matuschke, Jannik, Schlotter, Ildikó, Schmidt-Kraepelin, Ulrike

“…Let G be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings , i.e.,…”
Get full text

Lecture notes in computer science: research on hybrid grid algorithm of voronoi diagram by Wang, Binjun, Wang, Qiushi, Li, Jingying

“…Characteristics and performance of two grid methods, which include the growth method and the point by point scanning method of Voronoi diagram, are analyzed…”
Get full text

Improving the integrality gap for multiway cut by Bérczi, Kristóf, Chandrasekaran, Karthekeyan, Király, Tamás, Madan, Vivek

“…In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of k terminal nodes, and the goal is to partition…”
Get full text

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths by Ganian, Robert, Ordyniak, Sebastian

“…This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G…”
Get full text

Theoretical Analysis of Git Bisect by Courtiel, Julien, Dorbec, Paul, Lecoq, Romain

“…In this paper, we consider the problem of finding a regression in a version control system (VCS), such as git. The set of versions is modelled by a directed…”
Get full text

Surface matching via currents by Vaillant, Marc, Glaunès, Joan

“…We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is…”
Get more information

Idealness of k-wise intersecting families by Abdi, Ahmad, Cornuéjols, Gérard, Huynh, Tony, Lee, Dabeen

“…, and Seymour’s characterization of the binary matroids with the sums of circuits property. As further evidence for our conjecture, we also note that it follows from an unpublished conjecture of Seymour from 1975…”
Get full text

Approximation Results for Makespan Minimization with Budgeted Uncertainty by Bougeret, Marin, Jansen, Klaus, Poss, Michael, Rohwedder, Lars

“…We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the…”
Get full text

About the complexity of two-stage stochastic IPs by Klein, Kim-Manuel

“…We consider so called 2-stage stochastic integer programs (IPs) and their generalized form, so called multi-stage stochastic IPs. A 2-stage stochastic IP is an…”
Get full text

Network Discovery and Verification by Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihal'ak, M., Ram, L.S.

“…Due to its fast, dynamic, and distributed growth process, it is hard to obtain an accurate map of the Internet. In many cases, such a map-representing the…”
Get full text

Connected Vertex Cover for (sP1+P5)-Free Graphs by Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël

“…The Connected Vertex Cover problem is to decide if a graph  G has a vertex cover of size at most  k that induces a connected subgraph of  G . This is a…”
Get full text

Algorithms for flows over time with scheduling costs by Frascaria, Dario, Olver, Neil

“…Flows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an…”
Get full text

Packing under convex quadratic constraints by Klimm, Max, Pfetsch, Marc E., Raber, Rico, Skutella, Martin

“…We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX -hard to approximate…”
Get full text

Flip Distances Between Graph Orientations by Aichholzer, Oswin, Cardinal, Jean, Huynh, Tony, Knauer, Kolja, Mütze, Torsten, Steiner, Raphael, Vogtenhuber, Birgit

“…Flip graphs are a ubiquitous class of graphs, which encode relations on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra,…”
Get full text