Gruia Călinescu

From MaRDI portal
Person:247838

Available identifiers

zbMath Open calinescu.gruiaMaRDI QIDQ247838

List of research outcomes

PublicationDate of PublicationType
Finding large planar subgraphs and large subgraphs of a given genus2024-01-29Paper
An improved algorithm for finding maximum outerplanar subgraphs2024-01-24Paper
Faster compression of patterns to rectangle rule lists2023-10-16Paper
Combination algorithms for Steiner tree variants2023-04-21Paper
Faster compression of patterns to rectangle rule lists2020-05-26Paper
Improved approximation algorithms for minimum power covering problems2019-10-18Paper
Client assignment problems for latency minimization2019-06-25Paper
Improved approximation algorithms for minimum power covering problems2019-01-15Paper
T-joins in strongly connected hypergraphs2017-12-14Paper
Improved approximation algorithms for single-tiered relay placement2016-04-13Paper
1.61-approximation for min-power strong connectivity with two power levels2016-02-23Paper
Register loading via linear programming2015-09-02Paper
Relay placement for two-connectivity2015-04-09Paper
https://portal.mardi4nfdi.de/entity/Q29347012014-12-18Paper
Bounding the payment of approximate truthful mechanisms2014-12-02Paper
An improved approximation algorithm for resource allocation2014-09-09Paper
Sequential dependency computation via geometric data structures2014-01-22Paper
Approximate Min-Power Strong Connectivity2014-01-21Paper
Maximum series-parallel subgraph2012-04-26Paper
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint2012-03-15Paper
Register Loading via Linear Programming2011-08-12Paper
Disjoint bases in a polymatroid2010-11-09Paper
Min-Power Strong Connectivity2010-09-10Paper
https://portal.mardi4nfdi.de/entity/Q35754372010-07-27Paper
Algorithms - ESA 20032010-03-03Paper
Maximum Series-Parallel Subgraph2010-01-21Paper
Reconfigurations in Graphs and Grids2009-03-16Paper
Fast edge colorings with fixed number of colors to minimize imbalance2009-01-19Paper
Reconfigurations in Graphs and Grids2008-09-18Paper
A note on data structures for maintaining bipartitions2008-05-16Paper
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance2008-04-17Paper
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)2007-11-29Paper
On ring grooming in optical networks2007-10-12Paper
A fast localized algorithm for scheduling sensors2006-08-04Paper
Bounded-hops power assignment in ad hoc wireless networks2006-06-09Paper
https://portal.mardi4nfdi.de/entity/Q52902592006-04-28Paper
SEPARATING POINTS BY AXIS-PARALLEL LINES2006-03-13Paper
Algorithms and Computation2005-12-22Paper
Algorithms and Computation2005-12-22Paper
The polymatroid Steiner problems2005-10-18Paper
Approximation Algorithms for the 0-Extension Problem2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47375412004-08-11Paper
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width2004-03-14Paper
A new approximation algorithm for finding heavy planar subgraphs2003-08-17Paper
Traffic partition in WDM/SONET rings to minimize SONET ADMs2003-06-09Paper
Minimum-energy broadcasting in static ad hoc wireless networks2003-02-19Paper
https://portal.mardi4nfdi.de/entity/Q45425192002-08-01Paper
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q27682662002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q27415062001-10-24Paper
Alphabet-Independent and Scaled Dictionary Matching2001-03-12Paper
An improved approximation algorithm of MULTIWAY CUT.2000-11-21Paper
https://portal.mardi4nfdi.de/entity/Q38403531999-04-08Paper
A Better Approximation Algorithm for Finding Planar Subgraphs1998-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48751641996-06-16Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Gruia Călinescu