Loading…
Login
Scholar Register
Business Register
Subscribe
Loading…
Article Title
Abstract
Keyword
Category
MESH Heading
Grant Agency
RCAID
DOI
PMID
PMCID
Author
Affiliation
Email
Journal Title
ISSN
Publisher
Loading…
Contains
Equals
Find an Article
Find an Article (55212124)
Find a Category (124)
Find a Journal (6143)
Find a Scholar (3941)
Find an Academic Assistant (17)
Find an Article PDF (4602591)
Today's Articles (2)
Subscriber (49368)
Citation(s) in
RCA
4
(from Reference Citation Analysis)
Indexed Articles
Today (0)
Yesterday (0)
This Week (0)
Last Week (0)
Current Month (0)
Last Month (0)
Ranked By
Impact Index Per Article
Citation(s) in
RCA
Results Analysis
Year Published Analysis
Article Type Analysis
Journal Title Analysis
Category Analysis
Results Analysis
Year Published
2022 (1)
1996 (1)
1992 (2)
Show more
Refine
Article Statistics
RCA (4)
SCIE (4)
Refine
Publication Titles
INFORMATION PROCESSING LETTERS (2)
ACTA INFORMATICA (1)
ARTIFICIAL INTELLIGENCE (1)
Show more
Refine
Category
Computer Science, Information Systems (3)
Computer Science, Artificial Intelligence (1)
Show more
Refine
For:
Serna M
.
Approximating linear programming is log-space complete for P.
INFORM PROCESS LETT
1991. [DOI:
10.1016/0020-0190(91)90194-m
]
[
Citation(s) in
RCA
: 26
]
[
Impact Index Per Article: 0.8
]
[
Reference Citation Analysis
]
[
What about the content of this article? (
0
)
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 11/17/2022]
Number
Cited by Other Article(s)
1
Lukasiewicz T
, Malizia E. Complexity results for preference aggregation over (m)CP-nets: Max and rank voting.
ARTIF INTELL
2022. [DOI:
10.1016/j.artint.2021.103636
]
[
Citation(s) in
RCA
: 2
]
[
Impact Index Per Article: 1.0
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 12/01/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
2
Parallel Approximation Schemes for problems on planar graphs.
ACTA INFORM
1996. [DOI:
10.1007/s002360050049
]
[
Citation(s) in
RCA
: 8
]
[
Impact Index Per Article: 0.3
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 10/28/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
3
Stein C
, Wein J. Approximating the minimum-cost maximum flow is P-complete.
INFORM PROCESS LETT
1992. [DOI:
10.1016/0020-0190(92)90229-o
]
[
Citation(s) in
RCA
: 4
]
[
Impact Index Per Article: 0.1
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 10/16/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
4
Megiddo N
. A note on approximate linear programming.
INFORM PROCESS LETT
1992. [DOI:
10.1016/0020-0190(92)90132-f
]
[
Citation(s) in
RCA
: 4
]
[
Impact Index Per Article: 0.1
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 10/17/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
Page 1 of 1
1
Loading…
Loading…
Export Articles to File
Export Citation Analysis
Export Citation Analysis
Article Number From
to
A maximum of 600 records can be exported at a time.
Format:
*
Excel
Plain Text
PDF
WORD
Invalid value
Loading…
Click to Download the Exported File
Loading…
Loading…
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA
Select the Category
Loading…
Loading…
Impact Index Per Article
Calculation for Impact Index Per Article
Times Cited ÷ Number of Years = Impact Index Per Article
TM
Loading…
