Results 21 to 30 of about 282 (115)
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy [PDF]
In this paper we study recently introduced conflict version of the classical Feedback Vertex Set (FVS) problem. For a family of graphs F, we consider the problem F-CF-Feedback Vertex Set (F-CF-FVS, for short).
Lokshtanov, Daniel +4 more
core +1 more source
FPT approximations for packing and covering problems parameterized by elimination distance and even less [PDF]
For numerous graph problems in the realm of parameterized algorithms, using the size of a smallest deletion set (called a modulator) into well-understood graph families as parameterization has led to a long and successful line of research.
Kundu, Madhumita +4 more
core +1 more source
Climate change impacts on developing countries – evidence from Sri Lanka [PDF]
Climate Change, though a hot topic, is often viewed through the lens of catastrophic storms and wild-forest fires only. Kanesh Suresh, Clevo Wilson, Shunsuke Managi and Uttam Khanal instead present research evidence that focuses attention on the equally ...
Wilson, Clevo +3 more
core
The ancient Anatolian city of Kanesh (present-day Kültepe, Turkey) was a continuously inhabited site from the early Bronze Age through Roman times. The city flourished c.2000–1750 BCE as an Old Assyrian trade outpost and the earliest attested commercial society in world history.
openaire +1 more source
Parameterized Complexity of Conflict-Free Matchings and Paths [PDF]
An input to a conflict-free variant of a classical problem Gamma, called Conflict-Free Gamma, consists of an instance I of Gamma coupled with a graph H, called the conflict graph.
Jain, Pallavi +3 more
core +1 more source
New Validation of COVID-19\u27s effects on Micro, small and Medium Enterprise and Its Survival [PDF]
MSMEs (Micro, Small, and Medium-sized Enterprises) are the backbone of many economies worldwide, providing income and jobs to many people. The global and Sri Lankan economies have been seriously impacted by the coronavirus (COVID-19) outbreak.
Suresh, Kanesh
core +1 more source
Exploring the Kernelization Borders for Hitting Cycles [PDF]
A generalization of classical cycle hitting problems, called conflict version of the problem, is defined as follows. An input is undirected graphs G and H on the same vertex set, and a positive integer k, and the objective is to decide whether there ...
Jain, Pallavi +4 more
core +1 more source
Exact and Approximate Digraph Bandwidth [PDF]
In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately.
Jain, Pallavi +4 more
core +1 more source
Behavioral Intention to Use Public Transport Based on Theory of Planned Behavior
An increase in population generates increasing in travel demand. In Malaysia, public transport become an important modes of transport that connection people. This paper presents behavioural intention to use public transport especially public bus based on
Ambak Kamarudin +4 more
doaj +1 more source

