VLDB 2026 Research / reviewers in the wild / expert
Ioan Tomescu
dblp:06/2509
· DBLP profile ↗
30ranked-venue papers
21as first author
3since 2021 · last 2026
0000-0002-4747-9843ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 24 · 18 first-author · 3 since 2021Systems, architecture and hardware · 3 · 3 first-authorArtificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Maximum bond incident degree indices for trees and unicyclic graphs with given maximum degreeabstractThe bond incident degree (BID) index T f ( G ) of a connected graph G with edge-weight function f ( x , y ) is defined as T f ( G ) = ∑ v i v j ∈ E ( G ) f ( d ( v i ) , d ( v j ) ) , where f ( x , y ) > 0 is a symmetric real function with x ≥ 1 and y ≥ 1 and d ( u ) is the degree of vertex u in G . In this paper, we find extremal trees and unicyclic graphs of order n with given maximum degree having maximum bond incident degree index T f if edge-weight symmetric function f ( x , y ) satisfies five conditions. These conditions are fulfilled by sum-connectivity index, general sum-connectivity index, modified Sombor index and harmonic index. Ioan Tomescu |
Discret. Appl. Math. | 1 |
| 2022 | Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
Ioan Tomescu |
Discret. Appl. Math. | 1 |
| 2021 | Unified extremal results for k-apex unicyclic graphs (trees)
Muhuo Liu, Ioan Tomescu |
Discret. Appl. Math. | 2 |
| 2020 | Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices
Muhuo Liu, Ioan Tomescu |
Discret. Appl. Math. | 3 |
| 2019 | Extremal k-generalized quasi unicyclic graphs with respect to first and second Zagreb indices
Faisal Javaid, Muhammad Kamran Jamil, Ioan Tomescu |
Discret. Appl. Math. | 3 |
| 2019 | Proof of a conjecture concerning maximum general sum-connectivity index χα of graphs with given cyclomatic number when 1α2
Ioan Tomescu |
Discret. Appl. Math. | 1 |
| 2017 | Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number
Muhammad Kamran Jamil, Ioan Tomescu |
Discret. Appl. Math. | 2 |
| 2015 | On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices
Ioan Tomescu, Misbah Arshad |
Discret. Appl. Math. | 1 |
| 2014 | 2-Connected graphs with minimum general sum-connectivity index
Ioan Tomescu |
Discret. Appl. Math. | 1 |
| 2014 | Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index
Ioan Tomescu, Salma Kanwal |
Discret. Appl. Math. | 1 |
| 2010 | Ordering connected graphs having small degree distances
Ioan Tomescu |
Discret. Appl. Math. | 1 |
| 2010 | Series-parallel chromatic hypergraphs
Ioan Tomescu, Syed Ahtsham Ul Haq Bokhary |
Discret. Appl. Math. | 1 |
| 2007 | On the number of words containing the factor (aba)k
Ioan Tomescu |
Discret. Appl. Math. | 1 |
| 2006 | A characterization of the words occurring as factors in a minimum number of words
Ioan Tomescu |
Theor. Comput. Sci. | 1 |
| 2005 | Asymptotic Properties of the Factors of Words Over a Finite Alphabet
Ioan Tomescu |
Fundam. Informaticae | 1 |
| 2003 | On the number of occurrences of all short factors in almost all words
Ioan Tomescu |
Theor. Comput. Sci. | 1 |
| 2002 | On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques
Ioan Tomescu |
COCOON | 1 |
| 1999 | Some Extremal Properties of the Degree Distance of a Graph
Ioan Tomescu |
Discret. Appl. Math. | 1 |
| 1998 | On Words Containing all Short Subwords
Ioan Tomescu |
Theor. Comput. Sci. | 1 |
| 1996 | Negative Cycles in Complete Signed Graphs
Dragos Radu Popescu, Ioan Tomescu |
Discret. Appl. Math. | 2 |
| 1996 | On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet
Ioan Tomescu |
Theor. Comput. Sci. | 1 |
| 1994 | Minimum Spanning Hypertrees
Ioan Tomescu, Marius Zimand |
Discret. Appl. Math. | 1 |
| 1988 | Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons
Alexandru T. Balaban, Ioan Tomescu |
Discret. Appl. Math. | 2 |
| 1984 | Metric bases in digital geometry
Robert A. Melter, Ioan Tomescu |
Comput. Vis. Graph. Image Process. | 2 |
| 1984 | Digital metrics: A graph-theoretical approach
Frank Harary, Robert A. Melter, Ioan Tomescu |
Pattern Recognit. Lett. | 3 |
| 1983 | Path generated digital metrics
Robert A. Melter, Ioan Tomescu |
Pattern Recognit. Lett. | 2 |
| 1973 | A Combinatorial Algorithm for Solving Covering ProblemsabstractIn this correspondence a new combinational algorithm for the covering problems is proposed and computational experiments are analyzed. Ioan Tomescu |
IEEE Trans. Computers | 1 |
| 1972 | A Method for Minimizing the Number of States for a Restricted Class of Incompletely Specified Sequential Machines
Ioan Tomescu |
Math. Syst. Theory | 1 |
| 1972 | A Matrix Method for Determining All Pairs of Compatible States of a Sequential MachineabstractIn this note a matrix method is given that enables one to determine all pairs of compatible states in the case of incompletely specified sequential automata. Ioan Tomescu |
IEEE Trans. Computers | 1 |
| 1970 | A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching NetworkabstractAn efficient matrix algorithm is described which enables one to determine the complete connection matrix in only two steps. Ioan Tomescu |
IEEE Trans. Computers | 1 |