default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGruia Calinescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j50]Adrian Calinescu, Gruia Calinescu
:
Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid. Oper. Res. Lett. 59: 107217 (2025)- 2024
- [j49]Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi:
An improved algorithm for finding maximum outerplanar subgraphs. Discret. Appl. Math. 342: 207-217 (2024) - [j48]Gruia Calinescu, Xiaolang Wang:
A (1/2+1/60) - Approximation algorithm for Maximum Weight Series-Parallel Subgraph. Discret. Appl. Math. 354: 241-261 (2024) - [c52]Gruia Calinescu, Sami Davies, Samir Khuller, Shirley Zhang:
Online Flexible Busy Time Scheduling on Heterogeneous Machines. ESA 2024: 37:1-37:18 - [c51]Gruia Calinescu, Sumedha Uniyal:
Local Optimization Algorithms for Maximum Planar Subgraph. ESA 2024: 38:1-38:18 - [i4]Gruia Calinescu, Sami Davies, Samir Khuller, Shirley Zhang:
Online Flexible Busy Time Scheduling on Heterogeneous Machines. CoRR abs/2402.11109 (2024) - 2023
- [j47]Gruia Calinescu, Xiaolang Wang:
Combination Algorithms for Steiner Tree Variants. Algorithmica 85(1): 153-169 (2023) - [i3]Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi:
An Improved Algorithm for Finding Maximum Outerplanar Subgraphs. CoRR abs/2306.05588 (2023) - 2021
- [j46]Gruia Calinescu, Kai Wang:
A new LP rounding algorithm for the active time problem. J. Sched. 24(5): 543-552 (2021) - 2020
- [j45]Ian Albuquerque Raymundo Da Silva, Gruia Calinescu, Nathan De Graaf:
Faster compression of patterns to Rectangle Rule Lists. Theor. Comput. Sci. 828-829: 1-18 (2020)
2010 – 2019
- 2019
- [j44]Gruia Calinescu, Xiaolang Wang:
Client assignment problems for latency minimization. J. Comb. Optim. 37(3): 889-900 (2019) - [j43]Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved approximation algorithms for minimum power covering problems. Theor. Comput. Sci. 795: 285-300 (2019) - 2018
- [j42]Gruia Calinescu, Chenchen Fu, Minming Li, Kai Wang, Chun Jason Xue:
Energy Optimal Task Scheduling with Normally-Off Local Memory and Sleep-Aware Shared Memory with Access Conflict. IEEE Trans. Computers 67(8): 1121-1135 (2018) - [c50]Ian Albuquerque Raymundo Da Silva, Gruia Calinescu, Nathan De Graaf:
Faster Compression of Patterns to Rectangle Rule Lists. AAIM 2018: 190-208 - [c49]Gruia Calinescu, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithms for Minimum Power Covering Problems. WAOA 2018: 134-148 - [p3]Gruia Calinescu, Cristina G. Fernandes:
Maximum Planar Subgraph. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p2]Gruia Calinescu, Errol L. Lloyd, S. S. Ravi:
Topology Control Problems for Wireless Ad hoc Networks. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j41]Gruia Calinescu:
T-joins in strongly connected hypergraphs. Discret. Math. Algorithms Appl. 9(6): 1750068:1-1750068:19 (2017) - [c48]Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang:
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. ISAAC 2017: 19:1-19:13 - [i2]Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang:
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. CoRR abs/1710.10904 (2017) - 2016
- [j40]Gruia Calinescu:
1.61-approximation for min-power strong connectivity with two power levels. J. Comb. Optim. 31(1): 239-259 (2016) - [j39]Gruia Calinescu, Benjamin Grimmer, Satyajayant Misra, Sutep Tongngam, Guoliang Xue, Weiyi Zhang:
Improved approximation algorithms for single-tiered relay placement. J. Comb. Optim. 31(3): 1280-1297 (2016) - [c47]Samuel Baugh, Gruia Calinescu, David Rincon-Cruz, Kan Qiao:
Improved Algorithms for Two Energy-Optimal Routing Problems in Ad-Hoc Wireless Networks. BDCloud-SocialCom-SustainCom 2016: 509-516 - [c46]Chenchen Fu, Gruia Calinescu, Kai Wang, Minming Li, Chun Jason Xue:
Energy-Aware Real-Time Task Scheduling on Local/Shared Memory Systems. RTSS 2016: 269-278 - [r4]Gruia Calinescu:
Multiway Cut. Encyclopedia of Algorithms 2016: 1390-1393 - 2015
- [j38]Gruia Calinescu, Minming Li:
Register Loading via Linear Programming. Algorithmica 72(4): 1011-1032 (2015) - [j37]Gruia Calinescu:
Bounding the payment of approximate truthful mechanisms. Theor. Comput. Sci. 562: 419-435 (2015) - 2014
- [j36]Gruia Calinescu, Howard J. Karloff:
Sequential dependency computation via geometric data structures. Comput. Geom. 47(2): 141-148 (2014) - [j35]Gruia Calinescu:
Relay placement for two-connectivity. Discret. Optim. 14: 17-33 (2014) - [c45]Gruia Calinescu, Kan Qiao:
Minimum Power Broadcast: Fast Variants of Greedy Approximations. MASS 2014: 479-487 - 2013
- [j34]Gruia Calinescu:
Approximate Min-Power Strong Connectivity. SIAM J. Discret. Math. 27(3): 1527-1543 (2013) - [c44]Gruia Calinescu:
Faster approximation for Symmetric Min-Power Broadcast. CCCG 2013 - 2012
- [j33]Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky:
Maximum Series-Parallel Subgraph. Algorithmica 63(1-2): 137-157 (2012) - [c43]Gruia Calinescu, Kan Qiao:
Asymmetric topology control: Exact solutions and fast approximations. INFOCOM 2012: 783-791 - [c42]Gruia Calinescu:
Relay Placement for Two-Connectivity. Networking (2) 2012: 366-377 - [i1]Gruia Calinescu:
1.85 Approximation for Min-Power Strong Connectivity. CoRR abs/1205.3397 (2012) - 2011
- [j32]Gruia Calinescu, Sutep Tongngam:
Interference-aware broadcast scheduling in wireless networks. Ad Hoc Networks 9(7): 1069-1082 (2011) - [j31]Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. 40(6): 1740-1766 (2011) - [j30]Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani:
An improved approximation algorithm for resource allocation. ACM Trans. Algorithms 7(4): 48:1-48:7 (2011) - [c41]Gruia Calinescu, Howard J. Karloff:
Sequential Dependency Computation via Geometric Data Structures. CCCG 2011 - [c40]Gruia Calinescu, Sanjiv Kapoor, Michael Quinn, Junghwan Shin:
Adversary Games in Secure/Reliable Network Routing. GAMENETS 2011: 249-264 - [c39]Gruia Calinescu, Sanjiv Kapoor, Kan Qiao, Junghwan Shin:
Stochastic Strategic Routing Reduces Attack Effects. GLOBECOM 2011: 1-5 - [c38]Gruia Calinescu, Minming Li:
Register Loading via Linear Programming. WADS 2011: 171-182 - 2010
- [c37]Gruia Calinescu:
Min-Power Strong Connectivity. APPROX-RANDOM 2010: 67-80 - [c36]Tricha Anjali, Gruia Calinescu, Alexander Fortin, Sanjiv Kapoor, Nandakiran Kirubanandan, Sutep Tongngam:
Multipath Network Flows: Bounded Buffers and Jitter. INFOCOM 2010: 2714-2720
2000 – 2009
- 2009
- [j29]Gruia Calinescu, Chandra Chekuri, Jan Vondrák:
Disjoint bases in a polymatroid. Random Struct. Algorithms 35(4): 418-430 (2009) - [c35]Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul:
Maximum Series-Parallel Subgraph. WG 2009: 54-65 - 2008
- [j28]Gruia Calinescu, Cristina G. Fernandes:
On the k-Structure Ratio in Planar and Outerplanar Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j27]Gruia Calinescu, Michael J. Pelsmajer:
Fast edge colorings with fixed number of colors to minimize imbalance. J. Graph Algorithms Appl. 12(4): 401-417 (2008) - [j26]Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids. SIAM J. Discret. Math. 22(1): 124-138 (2008) - [c34]Gruia Calinescu, Robert B. Ellis:
Monitoring schedules for randomly deployed sensor networks. DIALM-POMC 2008: 3-12 - [c33]Gruia Calinescu, Sutep Tongngam:
Interference-Aware Broadcast Scheduling in Wireless Networks. MSN 2008: 258-266 - [c32]Gruia Calinescu, Sutep Tongngam:
Relay Nodes in Wireless Sensor Networks. WASA 2008: 286-297 - [r3]Gruia Calinescu:
Multiway Cut. Encyclopedia of Algorithms 2008 - [r2]Gruia Calinescu, Ophir Frieder, Peng-Jun Wan:
Wireless Ad Hoc Networks: Power Assignment. Encyclopedia of Wireless and Mobile Communications 2008 - 2007
- [j25]Gruia Calinescu, Peng-Jun Wan:
On Ring Grooming in optical networks. J. Comb. Optim. 13(2): 103-122 (2007) - [j24]Gruia Calinescu:
A note on data structures for maintaining bipartitions. J. Discrete Algorithms 5(1): 129-134 (2007) - [j23]Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky, Marius Zimand:
Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. J. Univers. Comput. Sci. 13(1): 1-3 (2007) - [c31]Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor:
Approximation Algorithms For Multipath Setup. GLOBECOM 2007: 438-442 - [c30]Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196 - [c29]David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang:
Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075 - [r1]Cristina G. Fernandes, Gruia Calinescu:
Maximum Planar Subgraph. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j22]Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat:
Bounded-hops power assignment in ad hoc wireless networks. Discret. Appl. Math. 154(9): 1358-1371 (2006) - [j21]Gruia Calinescu:
A fast localized algorithm for scheduling sensors. J. Parallel Distributed Comput. 66(4): 507-514 (2006) - [j20]Gruia Calinescu, Peng-Jun Wan:
Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks. Mob. Networks Appl. 11(2): 121-128 (2006) - [j19]Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky:
Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. Wirel. Networks 12(3): 287-299 (2006) - [c28]Gruia Calinescu, Michael J. Pelsmajer:
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. FSTTCS 2006: 117-128 - [c27]Gruia Calinescu, Adrian Dumitrescu, János Pach:
Reconfigurations in Graphs and Grids. LATIN 2006: 262-273 - [c26]Gruia Calinescu:
Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract). SNPD 2006: 225 - 2005
- [j18]Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan:
Separating Points by Axis-parallel Lines. Int. J. Comput. Geom. Appl. 15(6): 575-590 (2005) - [j17]Gruia Calinescu, Alexander Zelikovsky:
The Polymatroid Steiner Problems. J. Comb. Optim. 9(3): 281-294 (2005) - [j16]Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder:
Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks. Wirel. Networks 11(4): 531-533 (2005) - [c25]Dumitru Brinza, Gruia Calinescu, Sutep Tongngam, Alexander Zelikovsky:
Energy-efficient continuous and event-driven monitoring. MASS 2005 - [c24]Gruia Calinescu:
Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks. MASS 2005 - [p1]Gruia Calinescu, Ophir Frieder, Peng-Jun Wan:
A Survey of Algorithms for Power Assignment in Wireless Ad Hoc Networks. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks 2005: 147-158 - 2004
- [j15]Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky:
Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. Mob. Networks Appl. 9(2): 101-111 (2004) - [j14]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (2004) - [j13]Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi:
Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans. Netw. 12(3): 507-514 (2004) - [c23]Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan:
Separating points by axis-parallel lines. CCCG 2004: 7-10 - [c22]Gruia Calinescu:
Bounding the Payment of Approximate Truthful Mechanisms. ISAAC 2004: 221-233 - [c21]Gruia Calinescu, Alexander Zelikovsky:
The Polymatroid Steiner Problems. ISAAC 2004: 234-245 - [c20]Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat:
Bounded-hops power assignment in ad-hoc wireless networks. WCNC 2004: 1494-1499 - [c19]Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky:
Power efficient monitoring management in sensor networks. WCNC 2004: 2329-2334 - 2003
- [j12]Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky:
A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36(2): 179-205 (2003) - [j11]Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48(2): 333-359 (2003) - [j10]Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan, Yu Wang:
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks. IEEE Trans. Parallel Distributed Syst. 14(10): 1035-1047 (2003) - [c18]Gruia Calinescu:
Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. ADHOC-NOW 2003: 175-186 - [c17]Gruia Calinescu, Peng-Jun Wan:
Range Assignment for High Connectivity in Wireless Ad Hoc Networks. ADHOC-NOW 2003: 235-246 - [c16]Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky:
Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA 2003: 114-126 - [c15]Gruia Calinescu, Cristina G. Fernandes, Ion I. Mandoiu, Alexander Olshevsky, K. Yang, Alexander Zelikovsky:
Primal-dual algorithms for QoS multimedia multicast. GLOBECOM 2003: 3631-3635 - [c14]Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky:
Power efficient range assignment in ad-hoc wireless networks. WCNC 2003: 1889-1894 - 2002
- [j9]Gruia Calinescu, Peng-Jun Wan:
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs. J. Comb. Optim. 6(4): 425-453 (2002) - [j8]Gruia Calinescu, Ophir Frieder, Peng-Jun Wan:
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE J. Sel. Areas Commun. 20(1): 183-189 (2002) - [j7]Gruia Calinescu, Peng-Jun Wan:
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theor. Comput. Sci. 276(1-2): 33-50 (2002) - [j6]Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder:
Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wirel. Networks 8(6): 607-617 (2002) - [c13]Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky:
Symmetric Connectivity with Minimum Power Consumption in Radio Networks. IFIP TCS 2002: 119-130 - [c12]Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan:
Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks. INFOCOM 2002: 1268-1277 - [c11]Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani:
Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414 - 2001
- [j5]Gruia Calinescu, Cristina G. Fernandes:
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. Electron. Notes Discret. Math. 7: 194-197 (2001) - [c10]Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky:
Selecting forwarding neighbors in wireless Ad Hoc networks. DIAL-M 2001: 34-43 - [c9]Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder:
Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. INFOCOM 2001: 1162-1171 - [c8]Gruia Calinescu, Peng-Jun Wan:
Traffic partition in WDM/SONET rings to minimize SONET ADMs. IPDPS 2001: 201 - [c7]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
Approximation algorithms for the 0-extension problem. SODA 2001: 8-16 - 2000
- [j4]Amihood Amir, Gruia Calinescu:
Alphabet-Independent and Scaled Dictionary Matching. J. Algorithms 36(1): 34-62 (2000) - [j3]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000) - [j2]Peng-Jun Wan, Gruia Calinescu, Ophir Frieder:
Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE J. Sel. Areas Commun. 18(10): 1995-2003 (2000) - [c6]Gruia Calinescu, Peng-Jun Wan:
Wavelength Assignment in WDM Rings with Splitable Lightpaths. ISPAN 2000: 216-223
1990 – 1999
- 1998
- [j1]Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27(2): 269-302 (1998) - [c5]Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed:
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152 - [c4]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52 - 1996
- [c3]Gruia Calinescu, Cristina G. Fernandes:
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON 1996: 152-161 - [c2]Amihood Amir, Gruia Calinescu:
Alphabet Independent and Dictionary Scaled Matching. CPM 1996: 320-334 - [c1]Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25
Coauthor Index
Alex Zelikovsky
aka: Alexander Zelikovsky
aka: Alexander Zelikovsky
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-29 22:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
