default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnthony Vannelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j29]Abeer Y. Al-Hyari
, Ziad Abuowaimer, Timothy Martin, Gary Gréwal, Shawki Areibi, Anthony Vannelli:
Novel Congestion-estimation and Routability-prediction Methods based on Machine Learning for Modern FPGAs. ACM Trans. Reconfigurable Technol. Syst. 12(3): 16:1-16:25 (2019)- 2018
- [j28]Ziad Abuowaimer, Dani Maarouf, Timothy Martin, Jérémy Foxcroft, Gary Gréwal, Shawki Areibi, Anthony Vannelli:
GPlace3.0: Routability-Driven Analytic Placer for UltraScale FPGA Architectures. ACM Trans. Design Autom. Electr. Syst. 23(5): 66:1-66:33 (2018) - [c20]Dani Maarouf, Abeer Alhyari, Ziad Abuowaimer, Timothy Martin, Andrew David Gunter, Gary Gréwal, Shawki Areibi, Anthony Vannelli:
Machine-Learning Based Congestion Estimation for Modern FPGAs. FPL 2018: 427-434 - 2016
- [c19]Ryan Pattison, Ziad Abuowaimer, Shawki Areibi, Gary Gréwal, Anthony Vannelli:
GPlace: a congestion-aware placement tool for ultrascale FPGAs. ICCAD 2016: 68 - 2015
- [j27]James Ostrowski, Miguel F. Anjos, Anthony Vannelli:
Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150(1): 99-129 (2015) - 2012
- [j26]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems. Optim. Methods Softw. 27(3): 539-559 (2012) - 2011
- [j25]Ibolya Jankovits, Chaomin Luo, Miguel F. Anjos, Anthony Vannelli:
A convex optimisation framework for the unequal-areas facility layout problem. Eur. J. Oper. Res. 214(2): 199-215 (2011) - 2010
- [j24]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization. Electron. Notes Discret. Math. 36: 743-750 (2010) - [j23]Alexander Engau, Miguel F. Anjos, Anthony Vannelli:
On Interior-Point Warmstarts for Linear and Combinatorial Optimization. SIAM J. Optim. 20(4): 1828-1861 (2010) - [j22]Ahmed Youssef, Zhen Yang, Mohab Anis, Shawki Areibi, Anthony Vannelli, Mohamed I. Elmasry:
A Power-Efficient Multipin ILP-Based Routing Technique. IEEE Trans. Circuits Syst. I Regul. Pap. 57-I(1): 225-235 (2010) - [c18]James Ostrowski, Miguel F. Anjos, Anthony Vannelli:
Tight mixed integer linear programming formulations for generator Self-Scheduling. CCECE 2010: 1-4
2000 – 2009
- 2008
- [j21]Tamás Terlaky, Anthony Vannelli, Hu Zhang:
On routing in VLSI design and communication networks. Discret. Appl. Math. 156(11): 2178-2194 (2008) - [j20]Miguel F. Anjos, Anthony Vannelli:
Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes. INFORMS J. Comput. 20(4): 611-617 (2008) - [j19]Chaomin Luo, Miguel F. Anjos, Anthony Vannelli:
A nonlinear optimization methodology for VLSI fixed-outline floorplanning. J. Comb. Optim. 16(4): 378-401 (2008) - [j18]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang:
Packing trees in communication networks. J. Comb. Optim. 16(4): 402-423 (2008) - [c17]Chaomin Luo, Miguel F. Anjos, Anthony Vannelli:
Large-scale fixed-outline floorplanning design using convex optimization techniques. ASP-DAC 2008: 198-203 - 2007
- [j17]Zhen Yang, Anthony Vannelli, Shawki Areibi:
An ILP based hierarchical global routing approach for VLSI ASIC design. Optim. Lett. 1(3): 281-297 (2007) - 2006
- [j16]Miguel F. Anjos, Anthony Vannelli:
A New Mathematical-Programming Framework for Facility-Layout Design. INFORMS J. Comput. 18(1): 111-118 (2006) - [j15]Laleh Behjat, Anthony Vannelli, William D. Rosehart:
Integer Linear Programming Models for Global Routing. INFORMS J. Comput. 18(2): 137-150 (2006) - [j14]Dorothy Kucar, Anthony Vannelli:
Using Eigenvectors to Partition Circuits. INFORMS J. Comput. 18(2): 197-208 (2006) - 2005
- [j13]Miguel F. Anjos, Andrew A. Kennings, Anthony Vannelli:
A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discret. Optim. 2(2): 113-122 (2005) - [c16]Tamás Terlaky, Anthony Vannelli, Hu Zhang:
On Routing in VLSI Design and Communication Networks. ISAAC 2005: 1051-1060 - [c15]Pawoumodom L. Takouda, Miguel F. Anjos, Anthony Vannelli:
Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization. IWSOC 2005: 275-280 - [c14]Miguel F. Anjos, Anthony Vannelli:
On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems. OR 2005: 277-282 - [c13]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang:
Packing Trees in Communication Networks. WINE 2005: 688-697 - 2004
- [c12]Kristofer Vorwerk, Andrew A. Kennings, Anthony Vannelli:
Engineering details of a stable force-directed placer. ICCAD 2004: 573-580 - 2003
- [j12]Shawki Areibi, Anthony Vannelli:
Tabu Search: Implementation & Complexity Analysis for Netlist Partitioning. Int. J. Comput. Their Appl. 10(4): 211-232 (2003) - [c11]Laleh Behjat, Anthony Vannelli:
Steiner Tree Construction Based on Congestion for the Global Routing Problem. IWSOC 2003: 28-31 - [c10]Dorothy Kucar, Anthony Vannelli:
InterconnectionModelling Using Distributed RLC Models. IWSOC 2003: 32-35 - 2002
- [j11]Laleh Behjat, Dorothy Kucar, Anthony Vannelli:
A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout. J. Comb. Optim. 6(3): 271-286 (2002) - [j10]Miguel F. Anjos, Anthony Vannelli:
An Attractor-Repeller approach to floorplanning. Math. Methods Oper. Res. 56(1): 3-27 (2002) - 2000
- [j9]Shawki Areibi, Anthony Vannelli:
Tabu Search: A Meta Heuristic for Netlist Partitioning. VLSI Design 11(3): 259-283 (2000)
1990 – 1999
- 1999
- [c9]Hussein Etawil, Shawki Areibi, Anthony Vannelli:
Attractor-repeller approach for global placement. ICCAD 1999: 20-24 - [c8]Laleh Behjat, Anthony Vannelli:
VLSI concentric partitioning using interior point quadratic programming. ISCAS (6) 1999: 93-96 - 1998
- [c7]Yamin Du, Anthony Vannelli:
A nonlinear programming and local improvement method for standard cell placement. CICC 1998: 597-600 - 1997
- [j8]C.-J. Richard Shi, Anthony Vannelli, Jirí Vlach:
Performance-Driven Layer Assignment by Integer Linear Programming and Path-Constrained Hypergraph Partitioning. J. Heuristics 3(3): 225-243 (1997) - 1996
- [c6]Shawki Areibi, Anthony Vannelli:
A GRASP clustering technique for circuit partitioning. Satisfiability Problem: Theory and Applications 1996: 711-724 - 1995
- [j7]Weiguo Liu, Anthony Vannelli:
Generating Lower Bounds for the Linear Arrangement Problem. Discret. Appl. Math. 59(2): 137-151 (1995) - 1994
- [c5]P. Chin, Anthony Vannelli:
Interior Point Methods for Placement. ISCAS 1994: 169-172 - 1993
- [c4]Shawki Areibi, Anthony Vannelli:
Advanced Search Techniques for Circuit Partitioning. Quadratic Assignment and Related Problems 1993: 77-98 - [c3]Shawki Areibi, Anthony Vannelli:
Circuit Partitioning Using a Tabu Search Approach. ISCAS 1993: 1643-1646 - [c2]L. Song, Mohamed I. Elmasry, Anthony Vannelli:
Analog neural network building blocks based on current mode subthreshold operation. ISCAS 1993: 2462-2465 - 1992
- [j6]Scott W. Hadley, Brian L. Mark, Anthony Vannelli:
An efficient eigenvector approach for finding netlist partitions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(7): 885-892 (1992) - 1991
- [j5]Anthony Vannelli:
An adaptation of the interior point method for solving the global routing problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(2): 193-203 (1991) - [j4]Jirí Vlach, James A. Barby, Anthony Vannelli, T. Talkhan, C.-J. Richard Shi:
Group delay as an estimate of delay in logic. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(7): 949-953 (1991) - [c1]Anthony Vannelli:
A Parallel Implementation of an Interior Point Method for Linear Programming. PP 1991: 163-167
1980 – 1989
- 1988
- [j3]Earl R. Barnes, Anthony Vannelli, James Q. Walker:
A New Heuristic for Partitioning the Nodes of a Graph. SIAM J. Discret. Math. 1(3): 299-305 (1988) - 1985
- [j2]Anthony Vannelli, M. Vidyasagar:
Maximal lyapunov functions and domains of attraction for autonomous nonlinear systems. Autom. 21(1): 69-80 (1985) - [j1]Andrew Kusiak, Anthony Vannelli, K. Ravi Kumar:
Grouping problem in scheduling flexible manufacturing systems. Robotica 3(4): 245-252 (1985)
Coauthor Index
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 2024-10-07 21:24 CEST 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:
