A5008143115- Advanced Graph Theory Research
- Algorithms and Data Compression
- DNA and Biological Computing
- Complexity and Algorithms in Graphs
- semigroups and automata theory
- Optimization and Search Problems
- Graph Labeling and Dimension Problems
- graph theory and CDMA systems
- Cellular Automata and Applications
- Limits and Structures in Graph Theory
- Genome Rearrangement Algorithms
- Gene expression and cancer classification
- Advanced biosensing and bioanalysis techniques
- Machine Learning and Algorithms
- Mobile Ad Hoc Networks
- Interconnection Networks and Systems
- Misinformation and Its Impacts
- GDF15 and Related Biomarkers
- Ancient Mediterranean Archaeology and History
- Ancient and Medieval Archaeology Studies
- Quasicrystal Structures and Properties
- User Authentication and Security Systems
- Advanced Authentication Protocols Security
- Spam and Phishing Detection
- Distributed systems and fault tolerance
University of Bucharest
2015-2024
National Institute for Research and Development in Informatics - ICI Bucharest
2017-2024
National Museum
2015-2021
Masaryk University
2013-2018
Institute of Informatics of the Slovak Academy of Sciences
2018
Nazarbayev University
2013-2015
Aalto University
2010-2015
Ion Creangă Pedagogical State University
2015
Pedagogical University
2015
University of Bristol
2008-2011
Recently, hardness results for problems in P were achieved using reasonable complexity-theoretic assumptions such as the Strong Exponential Time Hypothesis. According to these assumptions, many graph-theoretic do not admit truly subquadratic algorithms. A central technique used tackle difficulty of above-mentioned is fixed-parameter algorithms with polynomial dependency fixed parameter (P-FPT). Applying this clique-width , an important graph parameter, remained be done. In article, we study...
Topological indices (TIs) play an important role in studying properties of molecules. A main problem mathematical chemistry is finding extreme graphs with respect to a given TI. In this paper extremal the modified first Zagreb connection index for trees general and number pendants, unicyclic or without fixed girth connected are determined, using methods higher degree generality transformation techniques usually used such context. These relevant chemical studies.
Abstract In kidney exchange programmes patients with end-stage renal failure may their willing, but incompatible living donors among each other. National are in operation ten European countries, and some of them have already conducted international exchanges through regulated collaborations. The selected by conducting regular matching runs (typically every three months) according to well-defined constraints optimisation criteria, which differ across countries. this work we give integer...
RNA-Seq technology offers new high-throughput ways for transcript identification and quantification based on short reads, has recently attracted great interest. This is achieved by constructing a weighted DAG whose vertices stand exons, arcs split alignments of the reads to exons. The task consists finding number paths, together with their expression levels, which optimally explain weights graph under various fitting functions, such as least sum squared residuals. In (Tomescu et al. BMC...
Graph colorings are a major area of study in graph theory involving the constrained assignment labels (colors) to vertices or edges. There many types defined literature. The most common type coloring is proper vertex k-coloring which as from set k colors such that no two adjacent share color. Our central focus this paper variant problem, termed graceful introduced by Gary Chartrand 2015. A an undirected connected G using induces edge coloring, where color for (u,v) absolute value difference...
The Shannon capacity of a graph $G$ is $c(G)=\sup_{d\geq 1}(\alpha(G^d))^{\frac{1}{d}},$ where $\alpha(G)$ the independence number $G$. Kneser $\mathrm{KG}_{n,r}$ was determined by Lovász in 1979, but little known about complement that when $r$ does not divide $n$. graph, $\overline{\mathrm{KG}}_{n,2}$, also called triangular $T_n$. $T_n$ has $n$-cycle $C_n$ as an induced subgraph, whereby $c(T_n) \geq c(C_n)$, and these two families graphs are closely related current context both can be...