Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. Val. 10520.

doi:10.1007/978-3-319-68705-6

?

Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers

Vol. 10520. Springer, 2017.

Academic editor: H. Bodlaender, G. Woeginger

This book constitutes the revised selected papers of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017, held in Eindhoven, The Netherlands, in June 2017.

The 31 full papers presented in this volume were carefully reviewed and selected
from 71 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.

New Results on Weighted Independent Domination

Loozin V. V., Malyshev D., Mosca R. et al., , in: Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected PapersVol. 10520.: Springer, 2017. P. 399–411.

Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. Only few examples of classes are available, where the problem admits polynomial-time solutions. In the present paper, we extend the short list of such classes with two new examples. ...

Added: July 12, 2019

Research target: Computer Science

Priority areas: IT and mathematics mathematics

Language: English

DOI

Keywords: graphs graphs

Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers

A Three-Party W-State Quantum Secret Sharing Protocol with X-Gate Encoding and Forbidden-Outcome Detection

Teregulov T., Loubenets E. R., / Series Quantum Physics "arXiv". 2026. No. 2609.31472.

We develop a new three-party quantum secret-sharing (QSS) protocol based on a three-qubit W state. This protocol encodes the secret-sequence bits using X gates and employs randomly selected Hadamard operations and measurement bases to generate information and security-test rounds. We evaluate the efficiency of the proposed protocol and analyze its security against an internal adversary ...

Added: September 28, 2026

Bytedance и Open Source - открытые проекты от разработчика TikTok

Silakov D., Системный администратор 2026 С. 84–89

Social media users rarely think about what lies behind the beautiful facade of activity feeds, teeming with photos and video stories. However, the widespread popularity of such platforms generates a huge amount of all sorts of content that needs to be stored, processed quickly, and displayed, and in the era of AI, it also needs ...

Added: September 28, 2026

Shape-aware deep learning for models of production

Prokhorov A., Wei Z., Sang H. et al., Journal of Productivity Analysis 2026 Vol. 65 P. 1–16

The stochastic frontier model (SFM) is widely employed in the analysis of productivity and efficiency, yet strict parametric forms, such as the Cobb-Douglas and Translog functions, are often assumed for modeling production, leading to potential misspecification issues. While semi- and nonparametric SFMs offer greater flexibility, they face challenges in imposing monotonicity and concavity to maintain ...

Added: September 28, 2026

Inverse quickest path problem on networks under weighted l_\infty norm

Qian X., Guan X., Zhang B. et al., Journal of Global Optimization 2026

Inverse quickest path problem on networks ...

Added: September 27, 2026

Navigating Complexity: Statistical Methods, Data Analysis, and Machine Learning for Actionable Insights

Switzerland: Springer Cham, 2026.

This volume gathers selected, peer-reviewed contributions presented at the 19th Conference of the International Federation of Classification Societies (IFCS 2026), held on 14–16 July 2026 in Milan, Italy. Reflecting the volume’s motto, Navigating Complexity – Statistical Methods, Data Analysis, and Machine Learning for Actionable Insights, the papers showcase modern methodologies and real-world applications designed to extract ...

Added: September 25, 2026

An early warning system for emerging markets

Kraevskiy A., Sokolovskiy E., Prokhorov A., Emerging Markets Review 2026 No. 74 P. 1–19

Financial markets of emerging economies are vulnerable to extreme and cascading information spillovers, surges, sudden stops and reversals. With this in mind, we develop a new online early warning system (EWS) to detect what is referred to as ‘concept drift’ in machine learning, as a ‘regime shift’ in economics and as a ‘change-point’ in statistics. ...

Added: September 25, 2026

Экспериментальное сравнение HTTP/2 и HTTP/3 в условиях программно моделируемой сетевой деградации

Дубич Е. В., Schagin D., Славянский форум 2026 № 2 (52) С. 560–565

The paper compares HTTP/2 and HTTP/3 for static resource transfer under software-simulated network degradation. The experiment shows that HTTP/3 is not universally faster, but it is more stable as latency and packet loss increase. ...

Added: September 25, 2026

Synthesis of Acyclic Models for Processes Without Repeating Events

Joulitov A.K., Lomazova I.A., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4(2) P. 215–224

In process mining, DFG (Directly-Follows Graph) models are popular due to their simplicity and clarity. However, if a process is acyclic but contains concurrent events, standard algorithms for discovering DFG models can generate "fake" cycles that do not actually exist in the event log. These cycles hinder the analysis of information processes, significantly reducing the ...

Added: September 24, 2026

Анализ протокола выработки общего ключа для управления микросхемой интеллектуальной карты

Добрина Д. Н., Nesterenko A., Прикладная дискретная математика. Приложение 2026 № 19 С. 151–159

Работа содержит результаты формального анализа криптографических механизмов, входящих в состав проекта методических рекомендаций «Защищенный универсальный протокол передачи данных и управления микросхемой интеллектуальной карты» (протокол SECUNDA). Получена формальная модель и перечень трудноразрешимых математических задач, трудоёмкостью решения которых можно оценить стойкость используемых криптографических механизмов. ...

Added: September 24, 2026

Pairings on the algebra of Laurent series over a ring

Levashev V., / Series arXiv "math". 2026. No. 2609.06010.

We prove that continuous A-bilinear pairings on the ring of Laurent series that are invariant under continuous automorphisms coincide, up to a constant, with the pairing given by the residue of a differential form over any commutative associative ring with identity. ...

Added: September 24, 2026

Discovering object-centric Petri nets with parametric arcs

I.I. Sergeev, I.A. Lomazova, Modeling and Analysis of Information Systems 2026 Vol. 33 No. 3 P. 394–419

Object-centric process mining has emerged as a powerful paradigm for analyzing event data involving multiple interacting business objects. Existing discovery techniques often rely on object-centric Petri nets with fixed arc multiplicities, limiting their ability to represent parametric resource consumption and production patterns and to capture quantitative dependencies between interacting object types. In this paper, we ...

Added: September 24, 2026

Iterative construction of the R-matrices in arbitrary dimensions

Pyatov P. N., Pivovarov P. A., / Series math "arxiv.org". 2026. No. 2609.06274.

We investigate a special ansats that allows for an iterative solution of the constant Yang-Baxter equation. Testing this ansatz, we construct four sequences of the constant R-matrices. In each sequence the R-matrices act on the tensor squares of vector spaces of linearly growing dimensions. Each R-matrix also depends on a single complex parameter. By analyzing the ...

Added: September 24, 2026

Hybrid Graph Retrieval-Augmented Language Agents for Collaborative Recommendation

Ivan Bulychev, Savchenko A., AI 2026 Vol. 7 No. 9 Article 380

Recent advances in large language model (LLM) agents have shown promise for autonomous decision-making in recommender systems. However, existing approaches suffer from two fundamental limitations: flat agent memories that conflate different information modalities and prohibitive computational costs that prevent scaling beyond a few hundred users. We propose Hybrid-GraphRAG, a recommender system that integrates hierarchical agent ...

Added: September 24, 2026

Risks and the image of the future in the study of AI technologies prospects

Snegirev A., Sychev S., Futures 2026 Vol. 183 P. 1–22

This study addresses the systemic identification and categorization of risks associated with AI development, arising from tensions between technological evolution and institutional, infrastructural, and economic contexts. Drawing on a constructionist methodology, we interpret technological risks as constitutive elements of expert communities' images of the future. Through in-depth interviews with 100 AI experts, proportionally representing corporate, ...

Added: September 23, 2026

Choosing Between AI Responses: How Valence, Arousal, and Dominance Shape User Preference

Parshakov P., Paklina S., International Journal of Human-Computer Interaction 2026 P. 1–17

This study examines how emotional tone shapes user preference in human–large language model (LLM) interaction. Drawing on the Computers as Social Actors framework, we treat conversational AI as a social communicator whose affective cues influence user judgments. Using large-scale pairwise preference data from LMSYS Chatbot Arena, we model emotional tone through the Valence–Arousal–Dominance framework and ...

Added: September 23, 2026

A Two-Stage Deep Reinforcement Learning Framework for Radio Resource Management and Network Slicing in 5G Heterogeneous Networks

Andrabi U., Wadood E., Ojha S. K. et al., IEEE Access 2026 Vol. 14 P. 103358–103375

The emergence of 5G networks, aimed at accommodating diverse service requirements such as enhanced Mobile Broadband (eMBB), Ultra-Reliable Low-Latency Communication (URLLC), and massive Machine-Type Communication (mMTC), has presented significant challenges in radio resource management and network slicing. In dynamic heterogeneous network systems, traditional heuristics and mathematical programming methods find it challenging to attain scalable multi-objective ...

Added: September 23, 2026

LLM-assisted writing and citation advantage: evidence from scientific publications before and after ChatGPT release

Paklina S., Parshakov P., Elena Rapoport, Scientometrics 2026 P. 1–26

Generative artificial intelligence has become a routine part of academic writing. While much of the debate has focused on questions of integrity and authorship, less attention has been paid to how AI-assisted writing may affect research evaluation itself. This paper asks a straightforward but important question: does the use of LLMs in academic writing change ...

Added: September 23, 2026

Label-Free Quantification in the Crux Toolkit

Kertesz-Farkas A., Acquaye F. L., Journal of Proteome Research 2026 Vol. 25 P. 3764–3768

Ultimately, most tandem mass spectrometry (MS/MS) proteomics experiments aim to not just detect but also quantify the proteins in a given complex sample. Here, we describe an extension to the Crux MS/MS analysis toolkit to enable label-free quantification of peptides. We demonstrate that Crux’s new quantification command, which is modeled after the algorithms implemented in ...

Added: September 23, 2026

Risk Assessment Models for Heated Tobacco Products

Maddalena L., Yildiz B., Del Vecchio Blanco F. et al., Risk Analysis 2026 Vol. 46 No. 4 P. 1–26

Heated tobacco products (HTPs) are marketed as alternatives to conventional cigarettes with a potential reduced risk profile. Yet, their actual impact on cancer and noncancer disease risk remains uncertain and requires rigorous quantitative assessment. In this study, we develop a unified and transparent computational framework for toxicological risk assessment of HTPs, integrating chemical emissions data ...

Added: September 22, 2026

On static manifolds with boundary admitting a nowhere-vanishing static potential

Medvedev V., / Series arXiv "math". 2026.

We study complete static manifolds with boundary admitting a nowhere-vanishing static potential. Our main result shows that, under a natural lower bound relating the scalar curvature and the boundary mean curvature, a simple static manifold with boundary must in fact have positive scalar curvature, negative boundary mean curvature, and be compact; we also obtain explicit ...

Added: September 19, 2026

On the Efficiency of Bounded Multi-Source Shortest Path Algorithm

Gromov R. S., Nesterov R.A., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4 P. 23–44

This paper explores the performance criteria of the newest algorithm for solving the problem of finding shortest paths on a graph from a given vertex – Bounded Multi-Source Shortest Path Algorithm (BM-SSP). The algorithm was published in 2025 and, as its creators claim, it is asymptotically superior to Dijkstra’s deterministic algorithm. However, in the publication devoted ...

Added: September 18, 2026

Vague stimulating ideas, images and metaphors in scientific thinking: researchers' work with horizons of unclear knowledge

Poddiakov A., / Series Social Science Research Network "Social Science Research Network". 2026. No. 7437658.

Clarity of knowledge and reasoning is necessary in many cases. Yet vagueness in scientific thinking related to surprise, curiosity, "ability to engage with not-knowing" (de Freitas) and abductive reasoning is also a crucially important source of scientific creativity which supplements combinatorial logic when dealing with the already known. Starting from studies by C. S. Peirce ...

Added: September 15, 2026

On phase-lock area parquet in a special slow-fast limit of model of Josephson junction.

Glutsyuk A., / Series arXiv "math". 2026.

B.Josephson (Nobel Prize, 1973) predicted a tunnelling effect for a system of two superconductors separated by a narrow dielectric (such a system is called Josephson junction): existence of a supercurrent through it and equations governing it. The overdamped Josephson junction is modeled by the family of differential equations on the 2-torus, dθdτ=1ω(cosθ+B+Acosτ), which is known as ...

Added: September 8, 2026

Infinitely many graph manifolds with unique geometrical piece that admit arbitrarily many Anosov flows

Pochinka O., Shmukler V., / Series math.RT "arXiv:1808.06395 [math.RT]". 2026.

Anosov flows have a long and rich history, firstly motivated by the study of geodesic flows in negative curvature surface by Anosov and Sinai. Not every closed manifold admits an Anosov flow for well-known reasons: the fundamental group of a 3-manifold M admitting an Anosov flow must have exponential growth, and M must be universally covered by R3. Nevertheless, there ...

Added: August 31, 2026